m-secure vertex cover of a graph

DOI10.1142/S1793830918500751MaRDI QIDQ4644785zbMATH OpenWikidataFDO

Authors Chitra Suseendran, P. Roushini Leely Pushpam

Publication date 9 January 2019

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

zbMATH Keywords

dominationvertex coversecure domination

Mathematics Subject Classification ID

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

Recommendations

• Secure vertex cover of a graph
• Edge protection in graphs
• Eternal \(m\)-security in certain classes of graphs
• An eternal vertex cover problem
• Maximum-demand graphs for eternal security

Cites work

• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• scientific article; zbMATH DE number 5572981 (Why is no real title available?)
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• Edge protection in graphs
• Further results on secure restrained domination in graphs
• Graphs with equal eternal vertex cover and eternal domination numbers
• On minimum vertex covers of generalized Petersen graphs
• Parameterized algorithm for eternal vertex cover
• Secure restrained domination in graphs
• Vertex Covers and Secure Domination in Graphs

Cited in

(1)

• Secure vertex cover of a graph

This page was built for publication: \(m\)-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 Q4644785)