Abstract
In 2008 Hedetniemi et al. introduced the concept of secondary dominating sets and pointed out that the problem of the existence of an independent (1,2)-set is NP-complete in the general case. In this paper we study independent (1,2)-dominating sets in certain classes of graphs. We give the complete characterization of G-join of graphs with an independent (1,2)-dominating set. Moreover, we determine the number of all independent (1,2)-dominating sets in the G-join of special factors using Padovan and Perrin numbers.
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.
