The following pages link to (Q4871072):
Displaying 25 items.
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- Extremal graphs with given order and the rupture degree (Q614351) (← 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)
- Graph vulnerability parameters, compression, and quasi-threshold graphs (Q1735681) (← links)
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs (Q2091163) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Bounds for different spreads of line and total graphs (Q2272495) (← links)
- Tree-core and tree-coritivity of graphs (Q2348704) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- A note on ``Tenacity of a graph with maximum connectivity'' (Q2636821) (← links)
- Stability measures of some static interconnection networks (Q2720125) (← links)
- Tenacity of complete graph products and grids (Q2766101) (← links)
- Robustness of random graphs based on graph spectra (Q2944617) (← links)
- Neighbor Isolated Tenacity of Graphs (Q3186667) (← links)
- Relationships between rupture degree and other parameters (Q3438781) (← links)
- The vertex attack tolerance of complex networks (Q4578160) (← links)
- Network robustness and residual closeness (Q4611485) (← links)
- Edge‐tenacious networks (Q4698225) (← links)
- On agglomeration-based rupture degree in networks and a heuristic algorithm (Q6050471) (← links)
- Spectral bounds for the vulnerability parameters of graphs (Q6125428) (← links)
- Computational complexity of network vulnerability analysis (Q6160687) (← links)
