On the super domination number of graphs

DOI10.22049/CCO.2019.26587.1122MaRDI QIDQ4957519zbMATH OpenOpenAlexFDO

Authors Douglas F. Klein, Eunjeong Yi, Juan A. Rodríguez-Velázquez

Publication date 9 September 2021

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

zbMATH Keywords

Cartesian productcorona productdomination numbersuper domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Super domination in graphs
• On the super domination number of lexicographic product graphs
• CONNECTED SUPER DOMINATION IN GRAPHS
• Super domination in trees
• Super dominating sets in graphs

Cited in

(15)

• A note on superbrittle graphs
• Finding a -regular supergraph of minimum order
• Super domination in trees
• On the super domination number of lexicographic product graphs
• A number theoretic problem on super line graphs
• Superior domination in graphs
• CONNECTED SUPER DOMINATION IN GRAPHS
• Forcing super domination number of a graph
• Super domination in graphs
• Relating the super domination and 2-domination numbers in cactus graphs
• Computational complexity aspects of super domination
• Super domination: graph classes, products and enumeration
• Some results on the super domination number of a graph
• Some results on the super domination number of a graph. II
• Supersaturated graphs and hypergraphs

This page was built for publication: On the super domination number of graphs

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