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

edge-removal-critical graphER-critical graphprotection of a graphsecure domination

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

• Defending the Roman Empire from multiple attacks
• Defending the Roman Empire---a new strategy
• 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?)
• 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

(27)

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

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)