The following pages link to Edge‐tenacious networks (Q4698225):
Displaying 18 items.
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- Tenacity of a graph with maximum connectivity (Q628322) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- Some results related to the tenacity and existence of \(k\)-trees (Q1026141) (← links)
- On edge-rupture degree of graphs (Q1732840) (← links)
- Tenacity of complete graph products and grids (Q2766101) (← links)
- Neighbor Isolated Tenacity of Graphs (Q3186667) (← links)
- Edge Rupture Degree of Graphs (Q4639897) (← links)
- Link Vulnerability in Networks (Q4640344) (← links)
- Computing the Scattering Number of Graphs (Q4780531) (← links)
- The scattering number of thorn graphs (Q4831402) (← links)
- (Q5150664) (← links)
- A Note on the Link Residual Closeness of Graphs Under Join Operation (Q5384124) (← links)
- Isolated Rupture in Composite Networks (Q6132390) (← links)
- Computational complexity of network vulnerability analysis (Q6160687) (← links)
- Isolated Rupture in Thorny Networks (Q6169935) (← links)
- Node and link vulnerability in complete multipartite networks (Q6554732) (← links)