The following pages link to Optimal K-secure graphs (Q1152375):
Displaying 8 items.
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- Neighbour-connectivity in regular graphs (Q1074600) (← links)
- Survival under random coverings of trees (Q1104333) (← links)
- On minimal neighbourhood-connected graphs (Q1182928) (← links)
- A new bound for neighbor-connectivity of abelian Cayley graphs (Q2497468) (← links)
- NEIGHBOR INTEGRITY OF TRANSFORMATION GRAPHS (Q2856006) (← links)
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs (Q5384524) (← links)
- Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time (Q6087804) (← links)
