Let G be a graph with vertex set V and edge set E, a set D subset of V is a total dominating set if every vertex v is an element of V has at least one neighbor in D. The minimum cardinality among all total dominating sets is called the total domination number, and it is denoted by gamma t(G).Given an arbitrary tree graph T, we consider some operators acting on this graph; S(T),R(T),Q(T) and T(T), and we give bounds of the total domination number of these new graphs using other parameters in the graph T. We also give the exact value of the total domination number in some of them.
机构:
Autonomous Univ Guerrero, Fac Math, Carlos E Adame 5, Col La Garita 39350, Acapulco, MexicoAutonomous Univ Guerrero, Fac Math, Carlos E Adame 5, Col La Garita 39350, Acapulco, Mexico
机构:
Univ Johannesburg, Dept Pure & Appl Math, Auckland Pk 2006, South AfricaUniv Johannesburg, Dept Pure & Appl Math, Auckland Pk 2006, South Africa
Henning, Michael A.
Naicker, Viroshan
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Pure & Appl Math, Auckland Pk 2006, South Africa
Rhodes Univ, Dept Math, ZA-6140 Grahamstown, South AfricaUniv Johannesburg, Dept Pure & Appl Math, Auckland Pk 2006, South Africa
机构:
Univ Johannesburg, Dept Math, ZA-2006 Johannesburg, South AfricaUniv Johannesburg, Dept Math, ZA-2006 Johannesburg, South Africa
Desormeaux, Wyatt J.
Haynes, Teresa W.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math, ZA-2006 Johannesburg, South Africa
E Tennessee State Univ, Dept Math, Johnson City, TN 37614 USAUniv Johannesburg, Dept Math, ZA-2006 Johannesburg, South Africa
Haynes, Teresa W.
Henning, Michael A.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Johannesburg, Dept Math, ZA-2006 Johannesburg, South AfricaUniv Johannesburg, Dept Math, ZA-2006 Johannesburg, South Africa