Partitioning the Vertices of a Graph into Two Total Dominating Sets

DOI10.2989/16073606.2016.1188862zbMath1423.05120OpenAlexW2476671973MaRDI QIDQ5236035

Unnamed Author, Wyatt J. Desormeaux, Teresa W. Haynes

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2016.1188862

zbMATH Keywords

vertex partitionsself-complementary graphstotal dominationdominating sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ A characterization of graphs with disjoint total dominating sets ⋮ Spanning trees with disjoint dominating and 2-dominating sets

Cites Work

• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• Approximating theDomatic Number
• Total Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partitioning the Vertices of a Graph into Two Total Dominating Sets