Computing the Scattering Number of Graphs

DOI10.1080/00207160211919MaRDI QIDQ4780531zbMATH OpenOpenAlexFDO

Authors Xinglou Han, Shenggui Zhang, Xueliang Li

Publication date 21 August 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160211919

zbMATH Keywords

gridhypercubeNP-complete problemscattering number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Recommendations

• Scattering number of the product of some special classes of graphs
• Scattering number in graphs
• Scattering number and extremal non-Hamiltonian graphs
• Scattering number and Cartesian product of graphs
• A note on extremal values of the scattering number

Cites work

• scientific article; zbMATH DE number 194538 (Why is no real title available?)
• scientific article; zbMATH DE number 861347 (Why is no real title available?)
• A catalogue of small maximal nonhamiltonian graphs
• Edge‐tenacious networks
• Graph theory with applications
• Hamiltonian results inK1,3-free graphs
• On a class of posets and the corresponding comparability graphs
• Recognizing tough graphs is NP-hard
• Scattering number in graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Tough graphs and Hamiltonian circuits.

Cited in

(29)

• Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
• Scattering number of digraphs
• Node and link vulnerability in complete multipartite networks
• Computing the weighted isolated scattering number of interval graphs in polynomial time
• A measure of graph vulnerability: Scattering number
• Scattering number and extremal non-Hamiltonian graphs
• scientific article; zbMATH DE number 5925154 (Why is no real title available?)
• Focusing of the scan statistic and geometric clique number
• A combinatorial approach to scattering diagrams
• Two variants of toughness of a graph and its eigenvalues
• Vulnerability parameters of split graphs
• Relationships between scattering number and other vulnerability parameters
• Vertex vulnerability parameters of Kronecker products of complete graphs
• A note on the link residual closeness of graphs under join operation
• The scattering number of strictly chordal graphs: linear time determination
• Link vulnerability in networks
• A polynomial algorithm for weighted scattering number in interval graphs
• scientific article; zbMATH DE number 7310279 (Why is no real title available?)
• Characterization of interval graphs that are unpaired 2-disjoint path coverable
• Scattering number of the product of some special classes of graphs
• Computational complexity of network vulnerability analysis
• Uniform scrambles on graphs
• On the scramble number of graphs
• Scattering number and Cartesian product of graphs
• On edge-rupture degree of graphs
• Edge scattering number of gear graphs
• Toughness of the corona of two graphs
• Spectral bounds for the vulnerability parameters of graphs
• Isolated scattering number of split graphs and graph products

This page was built for publication: Computing the Scattering Number of Graphs

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