Abstract
A general characterization of connected graphs on n vertices having the maximum possible independent domination number of ⌊n+2−2n⌋ is given. This result leads to a structural characterization of such graphs in all but a small finite number of cases. For certain situations, one of which occurs when n is a perfect square, the extremal graphs have a particularly simple structure.
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
