On the independence transversal total domination number of graphs

@article{Martnez2017OnTI,
  title={On the independence transversal total domination number of graphs},
  author={Abel Cabrera Mart{\'i}nez and Jos{\'e} M. Sigarreta Almira and Ismael Gonz{\'a}lez Yero},
  journal={Discrete Applied Mathematics},
  year={2017},
  volume={219},
  pages={65-73}
}
A total dominating set of a graph G having non empty intersectionwith 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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Connected graphs with maximum total domination number

  • R. Brigham, J. Carrington, R. Vitray
  • J. Combin. Math. Combin. Comput. 34
  • 2000

Fundamentals of Domination in Graphs

  • T. W. Haynes, S. T. Hedetniemi, P. J. Slater
  • in: Chapman and Hall/CRC Pure and Applied…
  • 1998
1 Excerpt

Np-completeness of total and connected domination and irredundance for bipartite graphs

  • J. Pfaff, R. Laskar, S. Hedetniemi
  • Tech. Rept. 428, Clemson University Clemson, SC
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…