Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
Sign Up to like & getrecommendations! Published in 2024 at "Opuscula Mathematica"
DOI: 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,… read more here.
Keywords: dominating; dominating set; set partitioned; vertex set ... See more keywords
Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set
Sign Up to like & getrecommendations! Published in 2025 at "Opuscula Mathematica"
DOI: 10.7494/opmath.2025.45.2.179
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. There exist infinite families of graphs that are not TI-graphs. We define… read more here.
Keywords: dominating; dominating set; operatorname; geq ... See more keywords