Disjunctive Total Domination of Some Shadow Distance Graphs

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Fundamental Journal of Mathematics and Applications
Volume:3 Issue:2
Disjunctive Total Domination of Some Shadow Distance Graphs

Disjunctive Total Domination of Some Shadow Distance Graphs

Pages : 185-193

View : 25 | Download : 9

Publication Date : 2020-12-15

Article Type : Research Paper

Abstract :Let $ G $ be a graph having vertex set $ Vinsert ignore into journalissuearticles values(G); $. For $ S\subseteq Vinsert ignore into journalissuearticles values(G); $, if each vertex is adjacent to a vertex in $ S $ or has at least two vertices in $ S $ at distance two from it, then the set $ S $ is a disjunctive total dominating set of $ G $. The disjunctive total domination number is the minimum cardinality of such a set. In this work, we discuss the disjunctive total domination of shadow distance graphs of some graphs such as cycle, path, star, complete bipartite and wheel graphs.
Keywords : Disjunctive total domination, Domination, Shadow distance graph

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.