Abstract
A total dominating set of a graph G=(V,E) is a subset D of V such that every vertex in V is adjacent to at least one vertex in D. The total domination number of G, denoted by γt(G), is the minimum cardinality of a total dominating set of G. A near-triangulation is a biconnected planar graph that admits a plane embedding such that all of its faces are triangles except possibly the outer face. We show in this paper that γt(G)≤⌊2n5⌋ for any near-triangulation G of order n≥5, with two exceptions.
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
