Abstract
Let G be a graph with vertex and edge sets V (G) and E(G), respectively. A set C ⊆ V (G) is called an outer-convex hop dominating if for every two vertices x, y ∈ V (G) \ C, the vertex set of every x−y geodesic is contained in V (G) \ C and for every a ∈ V (G) \ C, there exists b ∈ C such that dG(a, b) = 2. The minimum cardinality of an outer-convex hop dominating set of G, denoted by ̃γconh(G), is called the outer-convex hop domination number of G. In this paper, we generate some formulas for the parameters of some special graphs and graphs under some binary operations by characterizing first the outer-convex hop dominating sets of each of thesegraphs. Moreover, we establish realization result that identifies and determines the connection of this parameter with the standard hop domination parameter. It shows that given any graph, this new parameter is always greater than or equal to the standard hop domination parameter.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.