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.008zbMATH Open1547.05239MaRDI QIDQ6611090

Michael A. Henning, Teresa W. Haynes

Publication date: 26 September 2024

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

zbMATH Keywords

vertex partitionstotal dominationindependent domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint dominating and total dominating sets in graphs
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Independent domination in graphs: A survey and recent results
• Disjoint dominating and 2-dominating sets in graphs
• On graphs with disjoint dominating and 2-dominating sets
• Partitioning a graph into a dominating set, a total dominating set, and something else
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• Total Domination in Graphs
• Domination in Graphs: Core Concepts
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• A characterization of graphs with disjoint total dominating sets
• The complexity of satisfiability problems
• Graphs with disjoint 2-dominating sets

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