Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (Q6545237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set |
scientific article; zbMATH DE number 7854821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set |
scientific article; zbMATH DE number 7854821 |
Statements
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set (English)
0 references
29 May 2024
0 references
A graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. In this paper, the authors prove that complete multipartite graphs, maximal outerplanar graphs, and claw-free graphs with minimum degree at least 3 are TI-graphs and 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. They study regular graphs and cubic graphs that are TI-graphs. Among other results, it is proved that all toroidal graphs are TI-graphs. An open problem concludes the paper.
0 references
total domination
0 references
vertex partitions
0 references
independent domination
0 references
toroidal graphs
0 references
cubic graphs
0 references
0 references
0.923401176929474
0 references
0.8538079261779785
0 references
0.8472684025764465
0 references
0.8389562964439392
0 references
