Secure domination of honeycomb networks

DOI10.1007/S10878-020-00570-8zbMath1471.05078OpenAlexW3015857295MaRDI QIDQ2185819

Manju K. Menon, M. R. Chithra

Publication date: 5 June 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00570-8

zbMATH Keywords

dominationsecure dominationhoneycomb networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Secure domination of some graph operators ⋮ Security in Sierpiński graphs

Cites Work

• On a graph's security number
• Connected minimum secure-dominating sets in grids
• Security in graphs
• Bounds on a graph's security number
• A textbook of graph theory

This page was built for publication: Secure domination of honeycomb networks