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.
| Original language | English |
|---|---|
| Pages (from-to) | 543-563 |
| Number of pages | 21 |
| Journal | Opuscula Mathematica |
| Volume | 44 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2024 |
Keywords
- independent domination
- total domination
- vertex partitions
ASJC Scopus subject areas
- General Mathematics