Scattering number in graphs

DOI10.1002/1097-0037(200103)37:2%3C102::AID-NET5%3E3.0.CO;2-SMaRDI QIDQ2714911zbMATH OpenOpenAlexFDO

Authors Ziguo Wang, Shenggui Zhang

Publication date 30 October 2001

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/1097-0037(200103)37:2%3C102::aid-net5%3E3.0.co;2-s

zbMATH Keywords

connected graphconnectivityHamilton cyclenetworkNordhaus-Gaddum-type resultpathsscattering numbervulnerability

Mathematics Subject Classification ID

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

Recommendations

• A measure of graph vulnerability: Scattering number
• Vertex-neighbor-scattering number of graphs.
• Scattering number and Cartesian product of graphs
• The average scattering number of graphs
• Relationships between scattering number and other vulnerability parameters

Cited in

(36)

• Scattering number and extremal non-Hamiltonian graphs
• A measure of graph vulnerability: Scattering number
• On edge-rupture degree of graphs
• A polynomial algorithm of edge-neighbor-scattering number of trees
• Models and methods for solving the problem of network vulnerability
• The scattering number of strictly chordal graphs: linear time determination
• Characterization of interval graphs that are unpaired 2-disjoint path coverable
• A combinatorial approach to scattering diagrams
• Bounds for scattering number and rupture degree of graphs with genus
• Disjoint path covers joining prescribed source and sink sets in interval graphs
• A polynomial algorithm for weighted scattering number in interval graphs
• The isolated scattering number of graphs
• Vertex-neighbor-scattering number of trees
• The average scattering number of graphs
• A measure of graphs vulnerability: edge scattering number
• scientific article; zbMATH DE number 5925154 (Why is no real title available?)
• Edge-neighbor-scattering number of graphs
• The scattering number and integrity of the complete k-ary trees
• Vertex-neighbor-scattering number of bipartite graphs
• Scattering number of the product of some special classes of graphs
• The Size of a Minimum Critically m-Neighbor-Scattered Graph
• Vertex-neighbor-scattering number of graphs.
• Computing the Scattering Number of Graphs
• Relationships between scattering number and other vulnerability parameters
• The scattering number of thorn graphs
• General p-neighbor scattering number of graphs
• Some results for the rupture degree
• Scattering number and Cartesian product of graphs
• Edge scattering number of gear graphs
• Isolated scattering number of split graphs and graph products
• Vulnerability parameters of split graphs
• Spectral bounds for the vulnerability parameters of graphs
• Scattering number of digraphs
• Graphs of scramble number two
• Vertex vulnerability in wrapped butterfly network
• Two variants of toughness of a graph and its eigenvalues

This page was built for publication: Scattering number in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2714911)