Secure domination of some graph operators

DOI10.1007/s13226-022-00331-9zbMath1527.05136OpenAlexW4301399171MaRDI QIDQ6089327

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)

Cites Work

• Unnamed Item
• Unnamed Item
• On a graph's security number
• Connected minimum secure-dominating sets in grids
• On computing a minimum secure dominating set in block graphs
• The complexity of secure domination problem in graphs
• The secure domination problem in cographs
• Secure total domination in graphs: bounds and complexity
• Secure domination of honeycomb networks
• Security in graphs
• Double graphs
• Bounds on a graph's security number
• Several parameters of generalized Mycielskians
• Secure domination and secure total domination in graphs
• A textbook of graph theory

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