We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
GRAPHS WHOSE VERTEX SET CAN BE PARTITIONED INTO A TOTAL DOMINATING SET AND AN INDEPENDENT DOMINATING SET.
- Authors
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.
- Subjects
INDEPENDENT sets; DOMINATING set; REGULAR graphs
- Publication
Opuscula Mathematica, 2024, Vol 44, Issue 4, p543
- ISSN
1232-9274
- Publication type
Article
- DOI
10.7494/OpMath.2024.44.4.543