total domination number;
total dominating graph;
gamma graph;
PATHS;
D O I:
10.22049/cco.2024.27940.1401
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
A total dominating set of a graph G is a set D subset of V ( G ) such that every vertex of G is adjacent to some vertex in D . The total domination number gamma t ( G ) of G is the minimum cardinality of a total dominating set. The gamma -total dominating graph TD gamma ( G ) of G is the graph whose vertices are minimum total dominating sets, and two minimum total dominating sets of TD gamma ( G ) are adjacent if they differ by only one vertex. In this paper, we determine the total domination numbers of lollipop graphs, umbrella graphs, and coconut graphs, and especially their gamma -total dominating graphs.
机构:
Univ Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South AfricaUniv Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa
Henning, Michael A.
Topp, Jerzy
论文数: 0引用数: 0
h-index: 0
机构:
State Univ Appl Sci, PL-82300 Elblag, PolandUniv Johannesburg, Dept Math & Appl Math, ZA-2006 Auckland Pk, South Africa