Abstract
Let G=(V,E) be a connected graph. A two-outdegree equitable dominating set D of a graph G is called the neighborhood connected two-outdegree equitable dominating set (nc2oe-set) if the induced sub graph <N(D)> is connected. The minimum cardinality of the minimal neighborhood connected two-outdegree equitable dominating set is called neighborhood connected two-outdegree equitable domination number of G and is denoted by . In this paper, we initiated the a study of this parameter and obtained for the -obrazom graphs of and . Also, we investigated the two-outdegree equitable domination number of the -obrazom graphs of and .
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 of 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.
