A characterization of graphs with disjoint total dominating sets

DOI10.26493/1855-3974.1525.7F3MaRDI QIDQ5225045zbMATH OpenOpenAlexWikidataFDO

Authors Michael A. Henning, Iztok Peterin

Publication date 25 July 2019

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.1525.7f3

zbMATH Keywords

total domination numberdisjoint total dominating sets

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• 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?)
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• A characterization of graphs with disjoint dominating and paired-dominating sets
• A note on graphs with disjoint dominating and total dominating sets
• A survey of selected recent results on total domination in graphs
• Disjoint dominating and total dominating sets in graphs
• On coupon colorings of graphs
• On the total domatic number of regular graphs
• Partitioning the vertices of a cubic graph into two total dominating sets
• Partitioning the vertices of a graph into two total dominating sets
• Total domination in graphs
• Total domination in graphs

Cited in

(11)

• A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
• A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
• A characterization of graphs with disjoint dominating and paired-dominating sets
• Disjoint total dominating sets in near‐triangulations
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• Graphs with disjoint \(2\)-dominating sets
• Disjoint dominating and total dominating sets in graphs
• scientific article; zbMATH DE number 5531984 (Why is no real title available?)
• Self-stabilizing algorithm for two disjoint minimal dominating sets

This page was built for publication: A characterization of graphs with disjoint total dominating sets

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