γ-total dominating graphs of lollipop, umbrella, and coconut graphs

被引：0

作者：

Eakawinrujee, Pannawat ^{[1
,2
]}

Trakultraipruk, Nantapath ^{[2
]}

机构：

[1] Thammasat Univ, Fac Learning Sci & Educ, Thammasat Secondary Sch, Pathum Thani 12121, Thailand

[2] Thammasat Univ, Fac Sci & Technol, Dept Math & Stat, Pathum Thani 12120, Thailand

来源：

COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION | 2024年

关键词：

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.

引用

页数：12

共 25 条

[1] Alikhani S, 2019, AUSTRALAS J COMB, V73, P313
[2] [Anonymous], 2023, Electron. J. Graph Theory Appl., V11, P65, DOI [10.5614/ejgta.2023.11.1.6, DOI 10.5614/EJGTA.2023.11.1.6]
[3] [Anonymous], 1998, Fundamentals of Domination in Graphs
[4] [Anonymous], 2022, Int. J. Math. Comput. Sci., V17, P739
[5] Bien A., 2015, ANN MATH SILESIANAE, V29, P25, DOI DOI 10.1515/AMSIL-2015-0003
[6] TOTAL DOMINATION IN GRAPHS
COCKAYNE, EJ
DAWES, RM
HEDETNIEMI, ST
[J]. NETWORKS, 1980, 10 (03) : 211 - 219
[7] Connelly E, 2011, AKCE INT J GRAPHS CO, V8, P23
[8] γ-PAIRED DOMINATING GRAPHS OF CYCLES
Eakawinrujee, Pannawat
Trakultraipruk, Nantapath
[J]. OPUSCULA MATHEMATICA, 2022, 42 (01) : 31 - 54
[9] Fatehi D, 2017, ADV APPL DISCRET MAT, V18, P45, DOI 10.17654/DM018010045
[10] Fricke G., 2011, DISCUSS MATH GRAPH T, V31, P517

← 1 2 3 →