Abstract
A total dominating set of a graph G having non empty intersection with all the independent sets of maximum cardinality in G is an independent transversal total dominating set. The minimum cardinality of any independent transversal total dominating set is denoted by γtt(G). In this paper we introduce this concept and begin the study of its mathematical properties. Specifically, we prove that the complexity of the decision problem associated to the computation of the value of γtt(G) is NP-complete, under the assumption that the independence number is known. Moreover, we present tight lower and upper bounds on γtt(G) and give some realizability results in concordance with these bounds. For instance, we show that for any two positive integers a,b such that 2≤a≤2b3 there is a graph G of order b such that γtt(G)=a.
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.
