Minimal graphs with disjoint dominating and paired-dominating sets

DOI10.7151/dmgt.2328zbMath1459.05240arXiv1908.04189OpenAlexW2967571410MaRDI QIDQ2656336

Jerzy Topp, Michael A. Henning

Publication date: 11 March 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.04189

zbMATH Keywords

dominationpaired domination

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Disjoint dominating and total dominating sets in graphs
• Graphs with disjoint dominating and paired-dominating sets
• Dominating and total dominating partitions in cubic graphs
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Remarks about disjoint dominating sets
• An independent dominating set in the complement of a minimum dominating set of a tree
• Inverse domination in graphs
• Pairs of disjoint dominating sets and the minimum degree of graphs
• Partitioning the vertices of a cubic graph into two total dominating sets
• Disjoint dominating and 2-dominating sets in graphs
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• Trees with two disjoint minimum independent dominating sets
• 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
• Partitioning the Vertices of a Graph into Two Total Dominating Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal graphs with disjoint dominating and paired-dominating sets