A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS
Universal Journal of Mathematics and Mathematical Sciences · 2024
DOI: 10.17654/2277141724010 ↗Kurz gefasst
Fachartikel in der Zeitschrift Universal Journal of Mathematics and Mathematical Sciences, 2024. Verfasst von A. Lekha.
Abstract (Originalsprache)
A disjunctive dominating set of a graph is a subset such that every vertex is either adjacent to a vertex of or has at least two vertices in at a distance two from it in . The disjunctive domination number of , denoted by , is the minimum cardinality of a disjunctive dominating set. This paper provides a comprehensive survey of key results and findings on disjunctive domination in graphs.
Zitieren
APA
Lekha, A. (2024). A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS. Universal Journal of Mathematics and Mathematical Sciences. https://doi.org/10.17654/2277141724010
Vancouver
Lekha A. A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS. Universal Journal of Mathematics and Mathematical Sciences. 2024. doi:10.17654/2277141724010
BibTeX
@article{Lekha2024,
author = {Lekha, A.},
title = {A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS},
journal = {Universal Journal of Mathematics and Mathematical Sciences},
year = {2024},
doi = {10.17654/2277141724010}
}
EUVIMED