Papers
Journal of Ultra Scientist of Physical Sciences - A
Voulume: 33
Issue: 5
Article No. 1
The Packing Chromatic Number of Different Jump Sizes of Circulant Graphs
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)
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.
Keyword :
Coloring, ; Packing chromatic number, Circulant graph, AMS Subject Classification: 05C15, 05E30
Share
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
