The following pages link to Scattering number in graphs (Q2714911):
Displaying 21 items.
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- A measure of graph vulnerability: Scattering number (Q1608152) (← links)
- On edge-rupture degree of graphs (Q1732840) (← links)
- A polynomial algorithm of edge-neighbor-scattering number of trees (Q1733396) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Characterization of interval graphs that are unpaired 2-disjoint path coverable (Q2173303) (← links)
- A combinatorial approach to scattering diagrams (Q2187942) (← links)
- Bounds for scattering number and rupture degree of graphs with genus (Q2335659) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- A polynomial algorithm for weighted scattering number in interval graphs (Q2422741) (← links)
- The isolated scattering number of graphs (Q2886615) (← links)
- Vertex-neighbor-scattering number of trees (Q2893949) (← links)
- The average scattering number of graphs (Q2956887) (← links)
- (Q3013511) (← links)
- Computing the Scattering Number of Graphs (Q4780531) (← links)
- Relationships between scattering number and other vulnerability parameters (Q4831401) (← links)
- The scattering number of thorn graphs (Q4831402) (← links)
- SOME RESULTS FOR THE RUPTURE DEGREE (Q5168420) (← links)
- Vulnerability parameters of split graphs (Q5438691) (← links)
- Graphs of scramble number two (Q6172289) (← links)
