Secure domination critical graphs

DOI10.1016/J.DISC.2008.05.050MaRDI QIDQ1045117zbMATH OpenOpenAlexFDO

Authors P. J. P. Grobler, Christina M. Mynhardt

Publication date 15 December 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2008.05.050

zbMATH Keywords

secure dominationedge-removal-critical graphER-critical graphprotection of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Edge criticality in secure graph domination
• The cost of edge failure with respect to secure graph domination
• On secure domination in graphs
• scientific article; zbMATH DE number 2188623
• Secure domination subdivision number of a graph

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• scientific article; zbMATH DE number 2094533 (Why is no real title available?)
• scientific article; zbMATH DE number 2104838 (Why is no real title available?)
• scientific article; zbMATH DE number 2114685 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• Defending the Roman Empire from multiple attacks
• Defending the Roman Empire---a new strategy
• Irredundance, secure domination and maximum degree in trees
• Protection of complete multipartite graphs
• Roman domination in graphs.
• Secure domination and secure total domination in graphs

Cited in

(22)

• Secure domination parameters of Halin graph with perfect \(k\)-ary tree
• The cost of edge removal in graph domination
• Eternal and Secure Domination in Graphs
• Secure equitable subdivision number of graphs
• Exact algorithms for weak Roman domination
• Edge domination and secure edge domination in Mycielski graph of trees.
• Global security in claw-free cubic graphs
• Secure Italian domination in graphs
• On minimum secure dominating sets of graphs
• Secure dominating sets in the lexicographic product of graphs
• On the secure domination numbers of maximal outerplanar graphs
• A linear algorithm for secure domination in trees
• The cost of edge failure with respect to secure graph domination
• On computing a minimum secure dominating set in block graphs
• The complexity of secure domination problem in graphs
• On secure domination in trees
• A characterization of trees with equal independent domination and secure domination numbers
• Secure domination in proper interval graphs
• Edge criticality in secure graph domination
• Domination parameters and edge-removal-critical graphs
• Global secure sets of grid-like graphs
• Edge stability in secure graph domination

This page was built for publication: Secure domination critical graphs

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