The Packing Chromatic Number of Different Jump Sizes of Circulant Graphs
Author & Affiliation:
B. CHALUVARAJU
Department of Mathematics, Bangalore University, Jnanabharathi Campus Bangalore - 560 056 (India)
M. KUMARA
Department of Mathematics, Bangalore University, Jnanabharathi Campus Bangalore - 560 056 (India)
Keyword:
Coloring, ; Packing chromatic number, Circulant graph, AMS Subject Classification: 05C15, 05E30
Issue Date:
May 2021
Abstract:
The packing chromatic number χ(G) of a graph G = (V,E) is the smallest integer k such that the vertex set V(G) can be partitioned into disjoint classes V1 ,V2 ,...,Vk , where vertices in Vi have pairwise distance greater than i. In this paper, we compute the packing chromatic number of circulant graphs with different jump sizes.
Pages:
66-73
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
DOI:
http://dx.doi.org/10.22147/jusps-A/330501
Share This:
Copy the following to cite this article:
B. C. ; M. K., "The Packing Chromatic Number of Different Jump Sizes of Circulant Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 33, Issue 5, Page Number 66-73, 2021Copy the following to cite this URL:
B. C. ; M. K., "The Packing Chromatic Number of Different Jump Sizes of Circulant Graphs", Journal of Ultra Scientist of Physical Sciences, Volume 33, Issue 5, Page Number 66-73, 2021Available from: https://www.ultrascientist.org/paper/1546/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
