Secure domination subdivision number of a graph

DOI10.1142/S1793830919500368zbMath1418.05099OpenAlexW2944376133WikidataQ127900732 ScholiaQ127900732MaRDI QIDQ4968284

S. V. Divya Rashmi, S. Arumugam, A. Somasundaram

Publication date: 12 July 2019

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

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

zbMATH Keywords

subdivisionsecure dominationsecure domination numbersecure domination subdivision number

Mathematics Subject Classification ID

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

Related Items (1)

Open packing subdivision number of graphs

Cites Work

• Domination alteration sets in graphs
• Roman domination subdivision number of graphs
• Upper bounds for the Roman domination subdivision number of a graph
• Total domination subdivision numbers of trees
• Domination and independence subdivision numbers of graphs
• Domination Subdivision Numbers
• Total domination subdivision numbers of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure domination subdivision number of a graph