Scattering number in graphs

DOI<102::AID-NET5>3.0.CO;2-S 10.1002/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-SzbMath0971.05062OpenAlexW2093816675MaRDI QIDQ2714911

Ziguo Wang, Sheng Gui Zhang

Publication date: 30 October 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200103)37:2<102::aid-net5>3.0.co;2-s

zbMATH Keywords

networkpathsconnectivityvulnerabilityconnected graphHamilton cyclescattering numberNordhaus-Gaddum-type result

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (12)

Computing the Scattering Number of Graphs ⋮ Relationships between scattering number and other vulnerability parameters ⋮ The scattering number of thorn graphs ⋮ Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ Disjoint path covers joining prescribed source and sink sets in interval graphs ⋮ A polynomial algorithm for weighted scattering number in interval graphs ⋮ The average scattering number of graphs ⋮ Models and methods for solving the problem of network vulnerability ⋮ On edge-rupture degree of graphs ⋮ SOME RESULTS FOR THE RUPTURE DEGREE ⋮ Vulnerability parameters of split graphs ⋮ Bounds for scattering number and rupture degree of graphs with genus

Cites Work

• Unnamed Item

This page was built for publication: Scattering number in graphs