• WEAKLY CONVEX DOUBLY CONNECTED DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
Abstract
Let be a connected simple graph. A weakly convex dominating set of is a weakly convex doubly connected dominating set if is a doubly connected dominating set of . The weakly convex doubly connected domination number of , denoted by is the smallest cardinality of a convex doubly connected dominating set of . In this paper, we characterized the weakly convex doubly connected dominating sets of the composition and Cartesian product of graphs.
Keywords
Full Text:
PDF![Creative Commons License](https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
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 |