Universal Journal of Mathematics and Mathematical Sciences

The Universal Journal of Mathematics and Mathematical Sciences promotes the publication of articles in interdisciplinary fields such as finance, bioinformatics, and engineering, as well as core topics in mathematics. It encourages innovative ideas for teaching mathematics and statistics.

Submit Article

A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS

Authors

  • A. Lekha

Keywords:

domination in graphs, disjunctive domination in graphs, disjunctive domination number

DOI:

https://doi.org/10.17654/2277141724010

Abstract

A disjunctive dominating set of a graph $G=(V, E)$ is a subset $S \subseteq V$ such that every vertex $v \in V \backslash S$ is either adjacent to a vertex of $S$ or has at least two vertices in $S$ at a distance two from it in $G$. The disjunctive domination number of $G$, denoted by $\gamma_2^d(G)$, 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.

Received: October 25, 2024
Accepted: November 15, 2024

References

T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, NY, 1998.

P. Dankelmann, D. Day, D. Erwin, S. Mukwembi and H. Swart, Domination with exponential decay, Discrete Math. 309(19) (2009), 5877-5883.

W. Goddard, M. A. Henning and C. McPillan, The disjunctive domination number of a graph, Quaest. Math. 37 (2014), 547-561.

M. A. Henning and S. A. Marcon, Domination versus disjunctive domination in graphs, Quaest. Math. 29 (2016), 261-273.

M. A. Henning and S. A. Marcon, Domination versus disjunctive domination in trees, Discrete Appl. Math. 184 (2015), 171-177.

B. S. Panda, A. Pandey and S. Paul, Algorithmic aspects of disjunctive domination in graphs, in: Lecture Notes in Computer Science 9198 (2015), 325-336.

A. Lekha and K. S. Parvathy, Properties of disjunctive domination in product graphs, Malaya Journal of Matematik 8(1) (2020), 37-41.

F. P. Jamil and R. P. Malalay, On disjunctive domination in graphs, Quaestiones Mathematicae 43(2) (2020), 149-168.

A. Lekha and K. S. Parvathy, Efficient disjunctive dominating sets in graphs, Advances in Mathematics 10(3) (2021), 1215-1226.

A. Lekha and K. S. Parvathy, On disjunctive domination number of corona related graphs, J. Math. Comput. Sci. 11(3) (2021), 2538-2550.

W. Zhuang, Disjunctive domination in graphs with minimum degree at least two, Discrete Mathematics 346(7) (2023), 113438.

W. Zhuang, Bounds on the disjunctive domination number of a tree, RAIRO- Operations Research 56(4) (2022), 2389-2401.

Downloads

Published

2024-11-20

Issue

Vol. 20 No. 2 (2024)

Section

Articles

License

Copyright (c) 2024 Pushpa Publishing House, Prayagraj, India

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

A COMPREHENSIVE REVIEW OF DISJUNCTIVE DOMINATION IN GRAPHS. (2024). Universal Journal of Mathematics and Mathematical Sciences, 20(2), 163-172. https://doi.org/10.17654/2277141724010