Secure vertex cover of a graph

DOI10.1142/S1793830917500264zbMath1362.05101MaRDI QIDQ5347260

Chitra Suseendran, P. Roushini Leely Pushpam

Publication date: 23 May 2017

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

zbMATH Keywords

vertex coververtex covering numbersecure vertex coversecure vertex covering number

Mathematics Subject Classification ID

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

Cites Work

• Parallel concepts in graph theory
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Tight bounds for eternal dominating sets in graphs
• Secure restrained domination in graphs
• Weak Roman domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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