Computing the Scattering Number of Graphs

DOI10.1080/00207160211919zbMath1017.05095OpenAlexW2092855865MaRDI QIDQ4780531

Xinglou Han, Xue Liang Li, Sheng Gui Zhang

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

hypercubegridNP-complete problemscattering number

Mathematics Subject Classification ID

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

Related Items (15)

Toughness of the corona of two graphs ⋮ The scattering number of strictly chordal graphs: linear time determination ⋮ Relationships between scattering number and other vulnerability parameters ⋮ Characterization of interval graphs that are unpaired 2-disjoint path coverable ⋮ A polynomial algorithm for weighted scattering number in interval graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Computational complexity of network vulnerability analysis ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ A Note on the Link Residual Closeness of Graphs Under Join Operation ⋮ On edge-rupture degree of graphs ⋮ Link Vulnerability in Networks ⋮ Vertex vulnerability parameters of Kronecker products of complete graphs ⋮ Vulnerability parameters of split graphs ⋮ Computing the weighted isolated scattering number of interval graphs in polynomial time ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing tough graphs is NP-hard
• A catalogue of small maximal nonhamiltonian graphs
• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Scattering number in graphs
• Hamiltonian results inK1,3-free graphs
• Edge‐tenacious networks
• THE MAXIMUM CONNECTIVITY OF A GRAPH

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