The following pages link to (Q3789603):
Displaying 50 items.
- Some operations in hub-integrity of graphs (Q326932) (← links)
- Graph operations and neighbor rupture degree (Q364548) (← links)
- Fault-tolerant maximal local-connectivity on bubble-sort star graphs (Q479014) (← links)
- Extreme tenacity of graphs with given order and size (Q489128) (← links)
- Extremal graphs with given order and the rupture degree (Q614351) (← links)
- On the range of possible integrities of graphs \(G(n, k)\) (Q659726) (← links)
- Maximally local connectivity and connected components of augmented cubes (Q726407) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- A large class of maximally tough graphs (Q1182141) (← links)
- A survey of integrity (Q1199410) (← links)
- Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs (Q1306928) (← links)
- Edge-integrity: A survey (Q1313818) (← links)
- On the honesty of graph complements (Q1313844) (← links)
- On the edge-integrity of some graphs and their complements (Q1313866) (← links)
- Maximum and minimum toughness of graphs of small genus (Q1356471) (← links)
- Measuring the vulnerability for classes of intersection graphs (Q1364473) (← links)
- The vulnerability of some networks including cycles via domination parameters (Q1659210) (← links)
- Two results about the hypercube (Q1671353) (← links)
- Safe number and integrity of graphs (Q1671366) (← links)
- On edge-rupture degree of graphs (Q1732840) (← links)
- Graph vulnerability parameters, compression, and quasi-threshold graphs (Q1735681) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- Domination integrity of splitting graph of path and cycle (Q1952732) (← links)
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs (Q2091163) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- A polynomial algorithm for computing the weak rupture degree of trees (Q2279643) (← links)
- Edge integrity of nearest neighbor graphs and separator theorems (Q2312806) (← links)
- Tree-core and tree-coritivity of graphs (Q2348704) (← links)
- Edge vulnerability parameters of split graphs (Q2371083) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- Toughness and binding number (Q2448921) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Edge vulnerability parameters of bisplit graphs (Q2519517) (← links)
- Stability theorems for graph vulnerability parameters (Q2657079) (← links)
- Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them (Q2917207) (← links)
- The average lower reinforcement number of a graph (Q2953689) (← links)
- On the average lower bondage number of a graph (Q2954366) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
- On the toughness index of planar graphs (Q4277991) (← links)
- The vertex attack tolerance of complex networks (Q4578160) (← links)
- (Q4583406) (← links)
- Network robustness and residual closeness (Q4611485) (← links)
- (Q4627588) (← links)
- Robustness of Regular Caterpillars (Q4639921) (← links)
