@Article{Haynes2024,
author = "Haynes, Teresa W. and Henning, Michael A.",
title = "Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set",
journal = "Opuscula Math.",
year = "2024",
volume = "44",
number = "4",
pages = "543--563",
doi = "https://doi.org/10.7494/OpMath.2024.44.4.543",
url = "https://doi.org/10.7494/OpMath.2024.44.4.543",
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.",
keywords = "total domination, vertex partitions, independent domination",
issn = "1232-9274"
}