Abstract
Let G = (V(G), E(G)) be a graph and uvεE. A subset D ⊆ V of vertices is a dominating set if every vertex in V − D is adjacent to at least one vertex of D. The domination number is the minimum cardinality of a dominating set. Let u and v be elements of V. Then, u strongly dominates u and v weakly dominates u if (i)uvεE and (ii)deg(u) ≥ deg(v). A set D ⊆ V is a strong (weak) dominating set (sd-set)(wd-set) of G if every vertex in V − D is strongly dominated by at least one vertex in D. The strong (weak) domination number γs(γw) of G is the minimum cardinality of a sd-set (wd-set). In this paper, the strong and weak domination numbers of comet, double comet, double star and theta graphs are given. The theta graphs are important geometric graphs that have many applications, including wireless networking, motion planning, MST construction and real-time animation.
Sign-in/Register to access full text options 
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.
