Abstract
Let G be a simple graph of order n and minimum degree δ . The independent domination number i ( G ) is defined to be the minimum cardinality among all maximal independent sets of vertices of G . In this paper, we show that i ( G )⩽ n +2 δ −2 nδ . Thus a conjecture of Favaron is settled in the affirmative.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
