Circular chromatic number of lexicographic products
Author & Affiliation:
R. Ganapathy Raman
Department of Maths D.G. Vaishnav College, Chennai & Research Scholar in SCSVMYU (INDIA
R. Sattanathan
H.O.D. of Maths D.G. Vaishnav College, Chennai (INDIA)
Keyword:
Circular chromatic , lexicographic , productsu00a0
Issue Date:
August 2009
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) Categorical Product (G × H), (iii) Lexicographic Product (G . H) and (iv) Strong product (G H). We discuss some theorems on circular chromatic number of lexicographic products.
Pages:
583-584
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
R. G. Raman; R. Sattanathan, "Circular chromatic number of lexicographic products ", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 583-584, 2018Copy the following to cite this URL:
R. G. Raman; R. Sattanathan, "Circular chromatic number of lexicographic products ", Journal of Ultra Scientist of Physical Sciences, Volume 21, Issue 2, Page Number 583-584, 2018Available from: https://www.ultrascientist.org/paper/1227/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
