RT journal article
T1 Injective Coloring of Product Graphs
A1 Samadi, Babak
A1 Soltankhah, Nasrin
A1 González Yero, Ismael
A2 Matemáticas
K1 Injective coloring
K1 Open packing partitions ·
K1 Two-step graphs
K1 Vertex coloring
K1 Lexicographic product
K1 Direct product
K1 Strong product
K1 Cartesian product
K1 Open packing
K1 2-Distance coloring
AB The problem of injective coloring in graphs can be revisited through two differentapproaches: coloring the two-step graphs and vertex partitioning of graphs into openpacking sets, each of which is equivalent to the injective coloring problem itself.Taking these facts into account, we observe that the injective coloring lies betweengraph coloring and domination theory. We make use of these three points of view in thispaper so as to investigate the injective coloring of some well-known graph products.We bound the injective chromatic number of direct and lexicographic product graphsfrom below and above. In particular, we completely determine this parameter for thedirect product of two cycles. We also give a closed formula for the corona product oftwo graphs.
PB Springer
SN 2180-4206
YR 2024
FD 2024
LK http://hdl.handle.net/10498/33750
UL http://hdl.handle.net/10498/33750
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026