Injective Coloring of Product Graphs

Identificadores
URI: http://hdl.handle.net/10498/33750
DOI: 10.1007/S40840-024-01682-8
ISSN: 2180-4206
ISSN: 0126-6705
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2024Departamento/s
MatemáticasFuente
Bulletin of the Malaysian Mathematical Sciences Society - 2024, Vol. 47 n. 3 pp. 1-15Resumen
The problem of injective coloring in graphs can be revisited through two different
approaches: coloring the two-step graphs and vertex partitioning of graphs into open
packing sets, each of which is equivalent to the injective coloring problem itself.
Taking these facts into account, we observe that the injective coloring lies between
graph coloring and domination theory. We make use of these three points of view in this
paper so as to investigate the injective coloring of some well-known graph products.
We bound the injective chromatic number of direct and lexicographic product graphs
from below and above. In particular, we completely determine this parameter for the
direct product of two cycles. We also give a closed formula for the corona product of
two graphs.
Materias
Injective coloring; Open packing partitions ·; Two-step graphs; Vertex coloring; Lexicographic product; Direct product; Strong product; Cartesian product; Open packing; 2-Distance coloringColecciones
- Artículos Científicos [12034]
- Articulos Científicos Matemáticas [518]
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.






