A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set

DOI10.1016/J.DAM.2024.08.008MaRDI QIDQ6611090zbMATH OpenFDO

Authors Teresa W. Haynes, Michael A. Henning

Publication date 26 September 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.08.008

zbMATH Keywords

independent dominationtotal dominationvertex partitions

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• 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 into two total dominating sets
• A characterization of graphs with disjoint dominating and paired-dominating sets

Cites work

• A characterization of graphs with disjoint dominating and paired-dominating sets
• 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
• Disjoint dominating and 2-dominating sets in graphs
• Disjoint dominating and total dominating sets in graphs
• Domination in Graphs: Core Concepts
• Graphs with disjoint 2-dominating sets
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• On graphs with disjoint dominating and 2-dominating sets
• Partitioning a graph into a dominating set, a total dominating set, and something else
• Partitioning the vertices of a graph into a total dominating set and an independent dominating set.
• Structures of domination in graphs
• The complexity of satisfiability problems
• The nature of computation
• Topics in Domination in Graphs
• Total domination in graphs

Cited in

(4)

• 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 note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
• Reducing regular graphs to partition their vertices into a total dominating set and an independent dominating set

This page was built for publication: A characterization of 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 Q6611090)