Optimal K-secure graphs
From MaRDI portal
Publication:1152375
DOI10.1016/0166-218X(80)90042-6zbMath0461.05021OpenAlexW2046905033MaRDI QIDQ1152375
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
Trees (05C05) Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15)
Related Items (8)
Survival under random coverings of trees ⋮ Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ On minimal neighbourhood-connected graphs ⋮ A new bound for neighbor-connectivity of abelian Cayley graphs ⋮ The neighbour-scattering number can be computed in polynomial time for interval graphs ⋮ NEIGHBOR INTEGRITY OF TRANSFORMATION GRAPHS ⋮ Neighbour-connectivity in regular graphs
Cites Work
This page was built for publication: Optimal K-secure graphs
