k-dominator coloring of graphs
MATHEMATICA · 30.06.2026 · 68 (91) (1) · 61-73
DOI: 10.24193/mathcluj.2026.1.06 ↗Kurz gefasst
Fachartikel in der Zeitschrift MATHEMATICA, online erschienen am 30.06.2026. Verfasst von S. MADHUMITHA und 1 weiteren Autor:innen.
Abstract (Originalsprache)
Coloring and domination in graphs are two well explored areas of research in graph theory. Blending these notions, the dominator coloring of graphs was introduced in the literature; following which several variants of domination related coloring patterns have been defined and studied. In this article, we investigate the k-dominator coloring of graphs, a generalisation of the concept of dominator coloring of graphs. Here, we discuss certain properties of the k-dominator coloring of graphs based on the structure of the graphs, and the k-dominator chromatic number of certain classes of graphs such as paths, cycles, complete multi-partite graphs, etc. are determined. Also, the structure of trees whose 2-dominator coloring is the trivial proper coloring are characterised in the study.
Zitieren
APA
MADHUMITHA, S., & NADUVATH, S. (2026). k-dominator coloring of graphs. MATHEMATICA, 68 (91)(1), 61-73. https://doi.org/10.24193/mathcluj.2026.1.06
Vancouver
MADHUMITHA S, NADUVATH S. k-dominator coloring of graphs. MATHEMATICA. 2026;68 (91)(1):61-73. doi:10.24193/mathcluj.2026.1.06
BibTeX
@article{MADHUMITHA2026,
author = {MADHUMITHA, S. and NADUVATH, SUDEV},
title = {k-dominator coloring of graphs},
journal = {MATHEMATICA},
year = {2026},
volume = {68 (91)},
number = {1},
pages = {61--73},
doi = {10.24193/mathcluj.2026.1.06}
}
EUVIMED