Secure vertex cover of a graph

DOI10.1142/S1793830917500264MaRDI QIDQ5347260zbMATH OpenFDO

Authors Chitra Suseendran, P. Roushini Leely Pushpam

Publication date 23 May 2017

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

Full work available at URL https://doi.org/10.1142/S1793830917500264

zbMATH Keywords

secure vertex coversecure vertex covering numbervertex coververtex covering number

Mathematics Subject Classification ID

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

Recommendations

• \(m\)-secure vertex cover of a graph
• An eternal vertex cover problem
• Edge protection in graphs
• On graphs with minimal eternal vertex cover number
• On a graph's security number

Cites work

• Defending the Roman Empire---a new strategy
• Edge protection in graphs
• Edge roman domination in graphs
• scientific article; zbMATH DE number 5575574 (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 2188604 (Why is no real title available?)
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• On efficiently Roman dominatable graphs
• Parallel concepts in graph theory
• Roman domination in graphs.
• Secure restrained domination in graphs
• Secure total domination in graphs
• Tight bounds for eternal dominating sets in graphs
• Weak edge Roman domination in graphs
• Weak Roman domination in graphs

Cited in

(3)

• Independent protection in graphs
• \(m\)-secure vertex cover of a graph
• On the secure vertex cover pebbling number

This page was built for publication: Secure vertex cover of a graph

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