期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2017
卷号：14
期号：1
页码：63-69
DOI：10.1016/j.akcej.2016.11.001
语种：English
出版社：Elsevier
摘要：Abstract The packing chromatic number χ ρ ( G ) of a graph G is the smallest integer k for which there exists a mapping π : V ( G ) ⟶ { 1 , 2 , … , k } such that any two vertices of color i are at distance at least i + 1 . In this paper, we compute the packing chromatic number for certain fan and wheel related graphs.
关键词：KeywordsenPacking chromatic numberUniform n -fan split graphUniform n -wheel split graph
