m-secure vertex cover of a graph

DOI10.1142/S1793830918500751zbMATH Open1404.05156WikidataQ129323625 ScholiaQ129323625MaRDI QIDQ4644785FDOQ4644785

Authors: Chitra Suseendran, P. Roushini Leely Pushpam 

Publication date: 9 January 2019

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

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

zbMATH Keywords

dominationvertex coversecure domination

Mathematics Subject Classification ID

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

Cites Work

• Vertex Covers and Secure Domination in Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with equal eternal vertex cover and eternal domination numbers
• Edge protection in graphs
• Title not available (Why is that?)
• Parameterized algorithm for eternal vertex cover
• Secure restrained domination in graphs
• On minimum vertex covers of generalized Petersen graphs
• Further results on secure restrained 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)