Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set

DOI10.7494/OPMATH.2024.44.4.543MaRDI QIDQ6545237zbMATHFDO

Authors Teresa W. Haynes, Michael A. Henning

Publication date 29 May 2024

Published in Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

cubic graphstotal dominationtoroidal graphsindependent dominationvertex partitions

Mathematics Subject Classification ID

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

Recommendations

• 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
• Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
• Partitioning the vertices of a graph into two total dominating sets

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• A characterization of graphs with disjoint total dominating sets
• A note on graphs with disjoint dominating and total dominating sets
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• Disjoint dominating and total dominating sets in graphs
• Dominating and total dominating partitions in cubic graphs
• Domination in Graphs: Core Concepts
• Every 8-uniform 8-regular hypergraph is 2-colorable
• Independent domination in graphs: A survey and recent results
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Partitioning a graph into a dominating set, a total dominating set, and something else
• Partitioning the vertices of a cubic graph into two total dominating sets
• Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
• Structures of domination in graphs
• The Even Cycle Problem for Directed Graphs
• Thoroughly dispersed colorings
• Topics in Domination in Graphs
• Total domination in graphs
• Total domination in graphs

Cited in

(2)

• A characterization of 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

This page was built for publication: Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set

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