Some results on disjunctive domination in graphs
Abstract
A set D⊆V is a disjunctive dominating set of a graph G=(V,E), if for any x not in D, x is either a neighbor of a vertex in D or there are at least two vertices in D at a distance two from x. Minimum cardinality of such a subset D of V is called the disjunctive domination number of G. In this paper we obtain the values of the disjunctive domination number of splitting graph of path and cycle graphs.
Copyright © 2024 A. Lekha, K. S. Parvathy. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
A. Lekha, K. S. Parvathy, Some results on disjunctive domination in graphs, J. Math. Comput. Sci. 14 (2024), 16. https://doi.org/10.28919/jmcs/8917
BibTeX
@article{Lekha2024,
author = {Lekha, A. and Parvathy, K. S.},
title = {Some results on disjunctive domination in graphs},
journal = {J. Math. Comput. Sci.},
volume = {14},
year = {2024},
pages = {16},
doi = {10.28919/jmcs/8917}
}