RT journal article
T1 Coloring, location and domination of corona graphs
A1 González Yero, Ismael
A1 Kuziak, Dorota
A1 Rondón Aguilar, Amaury
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 Coloring
K1 domination
K1 location
K1 Roman domination
K1 corona graphs
AB A vertex coloring of a graph $G$ is an assignment of colors tothe vertices of  $G$ such that every two adjacent vertices of$G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the vertices of a graph, in which the process of labeling is done according to an extra condition. A set $S$ of vertices of a graph $G$ is a dominating set in $G$ ifevery vertex outside of $S$ is adjacent to at least one vertexbelonging to $S$. A domination parameter of $G$ is related to thosestructures of a graph satisfying some domination property togetherwith other conditions on the vertices of $G$. In this article we study several mathematical properties related to coloring, domination and location of corona graphs.We investigate the distance-$k$ colorings of corona graphs.Particularly, we obtain  tight bounds for the distance-$2$ chromaticnumber and distance-$3$ chromatic number of corona graphs, throughout somerelationships between the distance-$k$ chromatic number of coronagraphs and the distance-$k$ chromatic number of its factors.Moreover, we give the exact value of the distance-$k$ chromaticnumber of the corona of a path and an arbitrary graph. On the other hand, weobtain bounds for the Roman dominating number and the locating-domination number of corona graphs. We giveclosed formulaes for the $k$-domination number, the distance-$k$domination number, the independence domination number, the domaticnumber and the idomatic number of corona graphs.
PB Springer
SN 1420-8903
YR 2013
FD 2013-05-21
LK http://hdl.handle.net/10498/30923
UL http://hdl.handle.net/10498/30923
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026