Abstract
Let G be a simple graph of order n and minimum degree δ . The independent domination number i ( G ) is defined as the minimum cardinality of an independent dominating set of G . We prove the following conjecture due to Haviland [J. Haviland, Independent domination in triangle-free graphs, Discrete Mathematics 308 (2008), 3545–3550]: If G is a triangle-free graph of order n and minimum degree δ , then i ( G ) ≤ n − 2 δ for n / 4 ≤ δ ≤ n / 3 , while i ( G ) ≤ δ for n / 3 < δ ≤ 2 n / 5 . Moreover, the extremal graphs achieving these upper bounds are also characterized.
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.
