• SPLIT AND NONSPLIT NEIGHBORHOOD CONNECTED DOMINATION IN GRAPHS

V. R. Kulli*

Abstract


Let G=(V, E) be a connected graph without isolated vertices. A dominating set D of G is called a neighborhood connected dominating set if the induced subgraph N(D) is connected. A neighborhood connected dominating set ....

Keywords


split neighborhood connected domination, strong split neighborhood connected domination, nonsplit neighborhood connected domination.

Full Text:

pdf


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility		Web Counter