Partitioning the vertices of a graph into two total dominating sets

DOI10.2989/16073606.2016.1188862MaRDI QIDQ5236035zbMATH OpenOpenAlexFDO

Authors 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

dominating setsself-complementary graphstotal dominationvertex partitions

Mathematics Subject Classification ID

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

Recommendations

• A note on graphs with disjoint dominating and total dominating sets
• Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
• Partitioning the vertices of a cubic graph into two total dominating sets
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• scientific article; zbMATH DE number 1109413

Cites work

• A note on graphs with disjoint dominating and total dominating sets
• Approximating theDomatic Number
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1124606 (Why is no real title available?)
• scientific article; zbMATH DE number 2109321 (Why is no real title available?)
• scientific article; zbMATH DE number 2192159 (Why is no real title available?)
• Total domination in graphs

Cited in

(18)

• Partitioning the vertices of a cubic graph into two total dominating sets
• Spanning trees with disjoint dominating and 2-dominating sets
• Disjoint dominating and 2-dominating sets in graphs
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• Minimal graphs with disjoint dominating and paired-dominating sets
• Linear separation of total dominating sets in graphs
• Partitioning a graph into a dominating set, a total dominating set, and something else
• A note on graphs with disjoint dominating and total dominating sets
• scientific article; zbMATH DE number 1805967 (Why is no real title available?)
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• scientific article; zbMATH DE number 2109321 (Why is no real title available?)
• Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
• A characterization of graphs with disjoint total dominating sets
• Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• Partitioning the vertices of a graph or its complement into a total dominating set and an independent dominating set
• A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• Minimal graphs with disjoint dominating and total dominating sets

This page was built for publication: Partitioning the vertices of a graph into two total dominating sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236035)