Abstract
The middle graph [Formula: see text] of a graph [Formula: see text] is the graph obtained by subdividing each edge of [Formula: see text] exactly once and joining all these newly introduced vertices of adjacent edges of [Formula: see text]. It is known that the decision problems for Italian domination number [Formula: see text], [Formula: see text]-rainbow domination number [Formula: see text] and Roman domination number [Formula: see text] are NP-complete. Recently, it was proved that [Formula: see text] for a graph [Formula: see text] of order [Formula: see text]. In this paper, we continue to study several domination and domatic numbers in middle graphs. We also obtain closed formulas for domination, secure domination and total domination numbers in middle graphs of rooted product graphs.
Sign-in/Register to access full text options 
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
