Secure domination of some graph operators

DOI10.1007/S13226-022-00331-9MaRDI QIDQ6089327zbMATH OpenOpenAlexFDO

Authors Manju K. Menon, M. R. Chithra

Publication date 14 December 2023

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13226-022-00331-9

zbMATH Keywords

coronasecure domination numbersecure setdouble graphgeneralized Mycielskian

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Upper secure domination number of a graph
• Secure domination subdivision number of a graph
• Perfect secure domination in graphs
• Secure domination and secure total domination in graphs
• Global secure domination in graphs

Cites work

• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• scientific article; zbMATH DE number 2188604 (Why is no real title available?)
• A textbook of graph theory
• Bounds on a graph's security number
• Connected minimum secure-dominating sets in grids
• Double graphs
• On a graph's security number
• On computing a minimum secure dominating set in block graphs
• Secure domination and secure total domination in graphs
• Secure domination of honeycomb networks
• Secure total domination in graphs: bounds and complexity
• Security in graphs
• Several parameters of generalized Mycielskians
• The complexity of secure domination problem in graphs
• The secure domination problem in cographs

Cited in

(1)

• Secure Italian domination in graphs

This page was built for publication: Secure domination of some graph operators

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