Abstract
Let γ −( G) be the minus domination number of a graph G. It has been conjectured in Discrete Math. 199 (1999) 35 that γ −( G)⩾4((1+ n) 1/2−1)− n for all bipartite graph of order n. In this paper we prove this conjecture.
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.
