Packing chromatic numbers of finite super subdivisions of graphs
Filomat, Tome 34 (2020) no. 10, p. 3275
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Given a graph G and a positive integer i, an i-packing in G is a subset W of the vertex set of G such that the distance between any two distinct vertices from W is greater than i. The packing chromatic number of a graph G, χρ(G), is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ∈ {1, . . . , k}, where each Vi is an i-packing. In this paper, we present some general properties of packing chromatic numbers of finite super subdivisions of graphs. We determine the packing chromatic numbers of the finite super subdivisions of complete graphs, cycles and some neighborhood corona graphs.
Classification :
05C15, 05C70, 05C12
Keywords: Packing chromatic number, packing coloring, neighborhood corona, finite super subdivision
Keywords: Packing chromatic number, packing coloring, neighborhood corona, finite super subdivision
Rachid Lemdani; Moncef Abbas; Jasmina Ferme. Packing chromatic numbers of finite super subdivisions of graphs. Filomat, Tome 34 (2020) no. 10, p. 3275 . doi: 10.2298/FIL2010275L
@article{10_2298_FIL2010275L,
author = {Rachid Lemdani and Moncef Abbas and Jasmina Ferme},
title = {Packing chromatic numbers of finite super subdivisions of graphs},
journal = {Filomat},
pages = {3275 },
year = {2020},
volume = {34},
number = {10},
doi = {10.2298/FIL2010275L},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2010275L/}
}
TY - JOUR AU - Rachid Lemdani AU - Moncef Abbas AU - Jasmina Ferme TI - Packing chromatic numbers of finite super subdivisions of graphs JO - Filomat PY - 2020 SP - 3275 VL - 34 IS - 10 UR - http://geodesic.mathdoc.fr/articles/10.2298/FIL2010275L/ DO - 10.2298/FIL2010275L LA - en ID - 10_2298_FIL2010275L ER -
Cité par Sources :