Abstract
We consider the effect of the removal of a matching from a graph on the value of domination and domination-related parameters with emphasis on the removal of a maximum matching from a cubic graph or tree. For example, we show that the independent domination number of a nontrivial tree increases on the removal of any maximum matching.
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
