Circular chromatic number of some products

AUTHOR AND
AFFILIATION

R. GANAPATHY RAMAN
Assistant Professor, Department of Mathematics Pachaiyappa’s College Chennai (INDIA)

KEYWORDS:

Cartesian Product

Issue Date:

August 2014

Pages:

Vol.26 – No.2

ISSN:

2319-8044 (Online) – 2231-346X (Print)

Source:

Vol.26 – No.2

PDF

Click Here Download PDF

DOI:

jusps-A

ABSTRACT:

Of interest in this theory is the question of determining the circular chromatic number of product graphs. There are four kinds of graph products: (i) Cartesian Product (G 􀀀 H), (ii) Direct Product (G × H), (iii) Lexicographic Product (G . H) and (iv) Strong product (G 􀀀 H).

Copy the following to cite this Article:

R. GANAPATHY RAMAN, “Circular chromatic number of some products”, Journal of Ultra Scientist of Physical Sciences, Volume 26, Issue 2, Page Number , 2016


Copy the following to cite this URL:

R. GANAPATHY RAMAN, “Circular chromatic number of some products”, Journal of Ultra Scientist of Physical Sciences, Volume 26, Issue 2, Page Number , 2016

Available from: http://www.ultrascientist.org/paper/388/


Of interest in this theory is the question of determining the circular chromatic number of product graphs. There are four kinds of graph products: (i) Cartesian Product (G 􀀀 H), (ii) Direct Product (G × H), (iii) Lexicographic Product (G . H) and (iv) Strong product (G 􀀀 H).