Acyclic total dominating sets in cubic graphs

DOI10.2298/AADM170315009GzbMATH Open1499.05462OpenAlexW2939392755WikidataQ128048661 ScholiaQ128048661MaRDI QIDQ5028796FDOQ5028796

Authors: Wayne Goddard, Michael A. Henning 

Publication date: 10 February 2022

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/aadm170315009g

Recommendations

• Dominating and total dominating partitions in cubic graphs
• scientific article; zbMATH DE number 1885949
• On domination in Hamiltonian cubic graphs
• Cubic graphs with total domatic number at least two
• Partitioning the vertices of a cubic graph into two total dominating sets

zbMATH Keywords

cubic graphtotal dominationindependent dominating set

Mathematics Subject Classification ID

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

Cites Work

• Some remarks on domination
• Total domination in graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Acyclic domination
• Disjoint independent dominating sets in graphs
• On disjoint maximal independent sets in graphs
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
• Acyclic domination on bipartite permutation graphs

Cited In (2)

• Independent domination, colorings and the fractional idomatic number of a graph
• Fractional domatic, idomatic, and total domatic numbers of a graph

This page was built for publication: Acyclic total dominating sets in cubic graphs

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