Abstract
A set S of vertices of a graph G is a disjunctive dominating set if for every v ∈ V (G) \\ S, v is adjacent to a vertex in S or S contains two vertices each of distance two from v. We say that S is a disjunctive total dominating set if for every v ∈ V (G), v is adjacent to a vertex in S or S contains two vertices each of distance two from v. In this paper, we characterize the disjunctive dominating sets and the disjunctive total dominating sets in the join, corona and composition of graphs and, as a result, obtain the values of their respective corresponding disjunctive domination numbers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
