Secure domination of some graph operators

DOI10.1007/S13226-022-00331-9zbMATH Open1527.05136OpenAlexW4301399171MaRDI QIDQ6089327FDOQ6089327

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

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

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

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

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)