Abstract
Let G be a nontrivial connected graph. A dominating set D⊆V(G) is called a doubly connected dominating set of G if both 〈D〉 and 〈V(G)\D〉 are connected. Let D be a minimum connected dominating set of G. If S⊆V(G)\D is a connected dominating set of G, then S is called an inverse doubly connected dominating set of G with respect to D. Furthermore, the inverse doubly connected domination number, denoted by γ_cc^(-1) (G) is the minimum cardinality of an inverse doubly connected dominating set of G. An inverse doubly connected dominating set of cardinalities γ_cc^(-1) (G) is called γ_cc^(-1)-set. In this paper, we characterized the inverse doubly connected domination in the lexicographic product of two graphs and give some important results.
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 callMore From: International Journal For Multidisciplinary Research
Disclaimer: 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.
