Abstract
A vertex subset S of a graph G = (V,E) is called a (1,2)-dominating set if S is having the property that for every vertex v in V- S there is atleast one vertex in S of distance 1 from v and a vertex in S at a distance atmost 2 from v. The minimum cardinality of a (1, 2)-dominating set of G, denoted by ϒ (1, 2)(G), is called the (1, 2)-domination number of G. In this paper we discuss about the (1, 2)-dominating set of Shell graph C(n,n-3,), Jewel graph Jn and Comb graph Pn ʘ K1.
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 callMore From: International Journal for Research in Applied Science and Engineering Technology
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.
