Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
-
Published:2024
Issue:4
Volume:44
Page:543-563
-
ISSN:1232-9274
-
Container-title:Opuscula Mathematica
-
language:en
-
Short-container-title:Opuscula Math.
Author:
Haynes Teresa W.,Henning Michael A.
Abstract
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.
Publisher
AGH University Press