Inverse domination number of a graph: a survey
Boletim da Sociedade Paranaense de Matemática · 17.09.2025
DOI: 10.5269/bspm.77901 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 17.09.2025. Verfasst von S. R. Jayaram und 2 weiteren Autor:innen. Die Arbeit nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A subset $S$ of the vertex set of a graph $G$ is a dominating set if every vertex in the complement of $S$ is adjacent to some vertex of~$S$. The minimum cardinality among all minimal dominating sets is the domination number of the graph~$G$. For a minimal dominating set $D$ of $G$ if the graph does not have any isolated vertices, then $V-D$ contains a dominating set. Such a dominating set in $V-D$ is called an inverse dominating set of $G$ and the minimum cardinality among all inverse dominating sets is called the inverse domination number. This paper surveys existing results on inverse dominating sets, inverse domination number and lists some open problems on these concepts. The Kulli-Sigarkanti conjecture on inverse domination number is settled.
Zitieren
APA
Jayaram, S. R., Sriraj, M. A., & Reddy, P. S. K. (2025). Inverse domination number of a graph: a survey. Boletim da Sociedade Paranaense de Matemática. https://doi.org/10.5269/bspm.77901
Vancouver
Jayaram SR, Sriraj MA, Reddy PSK. Inverse domination number of a graph: a survey. Boletim da Sociedade Paranaense de Matemática. 2025. doi:10.5269/bspm.77901
BibTeX
@article{Jayaram2025,
author = {Jayaram, S. R. and Sriraj, M. A. and Reddy, P. Siva Kota},
title = {Inverse domination number of a graph: a survey},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2025},
doi = {10.5269/bspm.77901}
}
EUVIMED