Chromatic Pendant Domination in Graphs
Boletim da Sociedade Paranaense de Matemática · 30.10.2025 · 43 · 1-5
DOI: 10.5269/bspm.78373 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 30.10.2025. Verfasst von Swaroopa Rani N. C. und 1 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Let $G=(V,E)$ be a undirected, simple, finite graph. A subset $S$ of $V$ is said to be dominating set if for every $v$ in $V-D$ there exist $u$ in $D$ such that $u$ and $v$ are adjacent. A dominating set $S$ in $G$ is said to be a pendant dominating set if $\langle S \rangle$ contains at least one pendant vertex. We introduce the concept of chromatic pendant dominating set. A subset $S$ of $V$ is said to be chromatic pendant dominating set if $S$ is a pendant dominating set and $\chi ()= \chi (G)$, where $\chi (G)$ is a chromatic number of $G$. The minimum cardinality of the chromatic pendant dominating set in $G$ is called the chromatic pendant domination number of $G$, denoted by $\gamma_{cpe}(G)$. We find the chromatic pendant domination number of some standard graphs and characterize the graph for $\gamma_{cpe}(G)=2$.
Zitieren
APA
C., S. R. N., & Shanmukha, B. (2025). Chromatic Pendant Domination in Graphs. Boletim da Sociedade Paranaense de Matemática, 43, 1-5. https://doi.org/10.5269/bspm.78373
Vancouver
C. SRN, Shanmukha B. Chromatic Pendant Domination in Graphs. Boletim da Sociedade Paranaense de Matemática. 2025;43:1-5. doi:10.5269/bspm.78373
BibTeX
@article{C2025,
author = {C., Swaroopa Rani N. and Shanmukha, B.},
title = {Chromatic Pendant Domination in Graphs},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2025},
volume = {43},
pages = {1--5},
doi = {10.5269/bspm.78373}
}
EUVIMED