lydia mary juliette rayen - Academia.edu (original) (raw)

lydia mary juliette rayen

Uploads

Papers by lydia mary juliette rayen

Research paper thumbnail of On the Star Coloring of Graphs Formed From the Cartesian Product of Some Simple Graphs Research

Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least ... more Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The purpose of this paper is to study the star coloring of some graph families formed from the Cartesian product of some simple graphs.

Research paper thumbnail of of Mathematics And its Applications On the Star Coloring of Circulant Graphs

Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least ... more Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The aim of this paper is to determine the star chromatic number of some Circulant graphs.

Research paper thumbnail of of Mathematics And its Applications On the Star Coloring of Circulant Graphs

Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least ... more Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The aim of this paper is to determine the star chromatic number of some Circulant graphs.

Research paper thumbnail of On the Star Coloring of Graphs Formed From the Cartesian Product of Some Simple Graphs Research

Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least ... more Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The purpose of this paper is to study the star coloring of some graph families formed from the Cartesian product of some simple graphs.

Research paper thumbnail of of Mathematics And its Applications On the Star Coloring of Circulant Graphs

Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least ... more Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The aim of this paper is to determine the star chromatic number of some Circulant graphs.

Research paper thumbnail of of Mathematics And its Applications On the Star Coloring of Circulant Graphs

Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least ... more Let G = (V,E) be an undirected simple graph. The star chromatic number of a graph G is the least number of colors needed to color the path on four vertices with three distinct colors. The aim of this paper is to determine the star chromatic number of some Circulant graphs.

Log In