Unicyclic graphs with equal domination and complementary tree domination numbers

• Krishnakumari, B. ^[1] ; Venkatakrishnan, Y. B. ^[1]
  1. [1] SASTRA University

     SASTRA University

     India

     
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 35, Nº. 3, 2016, págs. 245-249
• Idioma: inglés
• DOI: 10.4067/S0716-09172016000300002
• Enlaces
  • Texto completo
• Resumen

  • Let G = (V, E) be a simple graph. A set  is a dominating set if every vertex in V(G) \ D is adjacent to a vertex of D. A dominating set D of a graph G is a complementary tree dominating set if induced sub graph (V \ D) is a tree. The domination (complementary tree domination, respectively) number of G is the minimum cardinality of a dominating (complementary tree dominating, respectively) set of G. We characterize all unicyclic graphs with equal domination and complementary tree domination numbers.

• Referencias bibliográficas
  • Citas [1] T. Haynes, S. Hedetniemi and P. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).
  • [2] T. Haynes, S. Hedetniemi and P. Slater (eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, New York, (1998).
  • [3] Joanna Raczek, Unicyclic graphs with equal total and total outerconnected domination numbers, Ars Comb 118, pp. 167-178, (2015).
  • [4] B. Krishnakumari and Y.B. Venkatakrishnan, A note on complementary tree domination number of tree, Proyecciones Journal of Mathematics...
  • [5] S. Muthammai, M. Bhanumathi and P. Vidhya, Complementary tree domination number of a graph, International Mathematical Forum 6, pp. 1273—1282,...