Abstract
In this paper, we construct a realization problems involving connected outer-hop independent hop domination and we determine its connections with other known parameters in graph theory. In particular, given two positive integers a and b with 2 ≤ a ≤ b are realizable as the connected hop domination, connected outer-hop independent hop domination, and connected outer-independent hop domination numbers, respectively, of a connected graph. In addition, we characterize the connected outer-hop independent hop dominating sets in some families of graphs, join and corona of two graphs, and we use these results to derive formulas for the parameters of these graphs.
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.
