TY  - JOUR
ID  - Haynes2024
LB  - Haynes2024
AU  - Haynes, Teresa W.
AU  - Henning, Michael A.
TI  - Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
ST  - Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2024
VL  - 44
IS  - 4
SP  - 543
EP  - 563
DO  - https://doi.org/10.7494/OpMath.2024.44.4.543
UR  - https://doi.org/10.7494/OpMath.2024.44.4.543
AB  - A graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield infinite families of graphs that are not TI-graphs. We study regular graphs that are TI-graphs. Among other results, we prove that all toroidal graphs are TI-graphs.
KW  - total domination
KW  - vertex partitions
KW  - independent domination
SN  - 1232-9274
ER  -