Abstract
In this paper, we consider strong domination number of P n k and C n k . Let G=(V,E) be a graph, V is a vertex set and E is an edge set of graph G and u,v ∈V . u strongly dominates v and v weakly dominates u if (i) uv ∈ E and (ii) d ( u, G ) ≥ d ( v, G ) . A set D ⊂V is a strong-dominating set ( sd -set) of G if every vertex in V-D is strongly dominated by at least one vertex in D . The strong domination number γ s of G is the minimum cardinality of an sd -set.
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.
