Abstract
A set S⊆V of vertices in a graph G=(V,E) without isolated vertices is a total dominating set if every vertex of V is adjacent to some vertex in S. The total domination numberγt(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision numbersdγt(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. In this paper we prove that sdγt(G)≤α′(G)+1 for some classes of graphs where α′(G) is the maximum cardinality of a matching of G.
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.
