The following pages link to A survey of integrity (Q1199410):
Displaying 41 items.
- Some operations in hub-integrity of graphs (Q326932) (← links)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- Network majority on tree topological network (Q510545) (← links)
- On the range of possible integrities of graphs \(G(n, k)\) (Q659726) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Bounded degree spanners of the hypercube (Q782941) (← links)
- Vertex vulnerability parameters of Kronecker products of complete graphs (Q963383) (← links)
- Edge-integrity: A survey (Q1313818) (← links)
- Safe number and integrity of graphs (Q1671366) (← links)
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs (Q1735259) (← 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)
- A vulnerability parameter of networks (Q2037692) (← links)
- Largest component and node fault tolerance for grids (Q2656897) (← links)
- Stability measures of some static interconnection networks (Q2720125) (← links)
- Neighbor Isolated Tenacity of Graphs (Q3186667) (← links)
- COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS (Q3569273) (← links)
- The neighbour-integrity of total graphs (Q4521206) (← links)
- (Q4627588) (← links)
- New upper bounds for the integrity of cubic graphs (Q4652865) (← links)
- Vulnerability in graphs: the neighbour-integrity of line graphs (Q4663308) (← links)
- Finding a fault tolerant routing on neighbour-faulty hypercube (Q4823343) (← links)
- The neighbour-integrity of boolean graphs and its compounds (Q4944661) (← links)
- On the neighbour-integrity of sequential joined graphs (Q4951742) (← links)
- Integrity of graph operations (Q4958095) (← links)
- Integrity of total transformation graphs (Q5061682) (← links)
- Weak and strong domination in thorn graphs (Q5113066) (← links)
- (Q5119409) (← links)
- (Q5150664) (← links)
- SOME RESULTS FOR THE RUPTURE DEGREE (Q5168420) (← links)
- Domination integrity of some graph classes (Q5214325) (← links)
- Global distribution center number of some graphs and an algorithm (Q5244298) (← links)
- Weak-Rupture Degree of Graphs (Q5298310) (← links)
- A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs (Q5384524) (← links)
- Exponential Independence Number of Some Graphs (Q5384526) (← links)
- On agglomeration-based rupture degree in networks and a heuristic algorithm (Q6050471) (← links)
- A note on the integrity of grids (Q6069150) (← links)
- Porous exponential domination number of some graphs (Q6087722) (← links)
- Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time (Q6087804) (← links)
- On Structural Parameterizations of the Harmless Set Problem (Q6492087) (← links)
