CONNECTED SUPER DOMINATION IN GRAPHS

DOI10.17654/DM019030273MaRDI QIDQ4973402zbMATH OpenOpenAlexWikidataFDO

Authors Remilou Liguarda, S. R. Canoy

Publication date 27 November 2019

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/dm019030273

zbMATH Keywords

Cartesian productconnected super dominationcoronadominationjoinlexicographic productsuper domination

Mathematics Subject Classification ID

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

Recommendations

• Super domination in graphs
• Super dominating sets in graphs
• scientific article; zbMATH DE number 3873384
• Superior domination in graphs
• On the super domination number of graphs
• On super i‐connected graphs
• Totally connected domination in graphs
• Connected p-domination in graphs
• Generalized connected domination in graphs
• Connected domination of regular graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On the super domination number of lexicographic product graphs
• Secure total domination in graphs
• Super dominating sets in graphs
• Super domination in graphs

Cited in

(6)

• On the super domination number of graphs
• Connected \(dr\)-power dominating sets in graphs
• Forcing super domination number of a graph
• Super domination in graphs
• Super domination: graph classes, products and enumeration
• Some results on the super domination number of a graph

This page was built for publication: CONNECTED SUPER DOMINATION IN GRAPHS

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