Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
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-graph...
Sparad:
| Huvudupphov: | , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Utgiven: |
AGH Univeristy of Science and Technology Press
2024-04-01
|
| Serie: | Opuscula Mathematica |
| Ämnen: | |
| Länkar: | https://www.opuscula.agh.edu.pl/vol44/4/art/opuscula_math_4426.pdf |
| Taggar: |
Inga taggar, Lägg till första taggen!
|