Abstract
A set S of vertices of a graph G = ( V , E ) is a dominating set if every vertex of V ( G ) ∖ S is adjacent to some vertex in S . The domination number γ ( G ) is the minimum cardinality of a dominating set of G . The domination subdivision number sd γ ( G ) is the minimum number of edges that must be subdivided in order to increase the domination number. Velammal showed that for any tree T of order at least 3, 1 ≤ sd γ ( T ) ≤ 3 . In this paper, we give two characterizations of trees whose domination subdivision number is 3 and a linear algorithm for recognizing them.
Sign-in/Register to access full text options 
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.
