DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS
Advances and Applications in Discrete Mathematics · 2025
DOI: 10.17654/0974165825023 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2025. Verfasst von S. Megala und 3 weiteren Autor:innen.
Abstract (Originalsprache)
A dominator coloring of a graph is a proper coloring in which every vertex is adjacent to at least one vertex from each color class. The minimum number of colors required to achieve a dominator coloring of is called the dominator chromatic number, denoted as . In this paper, we obtain the dominator chromatic number of the lexicographic product of a path with certain graphs.
Zitieren
APA
Megala, S., Mohanapriya, N., Karthika, R., & Kalaivani, R. (2025). DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS. Advances and Applications in Discrete Mathematics. https://doi.org/10.17654/0974165825023
Vancouver
Megala S, Mohanapriya N, Karthika R, Kalaivani R. DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS. Advances and Applications in Discrete Mathematics. 2025. doi:10.17654/0974165825023
BibTeX
@article{Megala2025,
author = {Megala, S. and Mohanapriya, N. and Karthika, R. and Kalaivani, R.},
title = {DOMINATOR CHROMATIC NUMBER OF LEXICOGRAPHIC PRODUCT OF PATH WITH CERTAIN GRAPHS},
journal = {Advances and Applications in Discrete Mathematics},
year = {2025},
doi = {10.17654/0974165825023}
}
EUVIMED