Optimal K-secure graphs

DOI10.1016/0166-218X(80)90042-6MaRDI QIDQ1152375zbMATH OpenOpenAlexFDO

Authors Georg Gunther, Bert L. Hartnell

Publication date 1980

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(80)90042-6

zbMATH Keywords

resistance movement

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15)

Cites work

• A general class of invulnerable graphs
• scientific article; zbMATH DE number 3477199 (Why is no real title available?)
• scientific article; zbMATH DE number 3628999 (Why is no real title available?)
• On Designing a Reliable Hierarchical Structure

Cited in

(11)

• The neighbour-scattering number can be computed in polynomial time for interval graphs
• Neighbour-connectivity in regular graphs
• Survival under random coverings of trees
• On minimal neighbourhood-connected graphs
• A new bound for neighbor-connectivity of abelian Cayley graphs
• Neighbor integrity of transformation graphs
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
• Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
• Neighbor connectivity of hypercube-based compound network
• Neighbor connectivity of undirected toroidal meshes
• Neighbor connectivity of hierarchical pancake networks

This page was built for publication: Optimal K-secure graphs

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