Abstract
A node in a graph G = ( V, E) is said to dominate itself and all nodes adjacent to it. A set S ⊂ V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of Nordhaus-Gaddum results for several domination-related parameters. Then we present new inequalities of this type involving double domination. A direct result of our bounds for double domination in complementary graphs is a new Nordhaus-Gaddum inequality for open domination improving known bounds for the case when both G and its complement have domination number greater than 4.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.