Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
From MaRDI portal
Publication:5189514
DOI10.1137/070692698zbMath1193.05103MaRDI QIDQ5189514
Dominic Lanphier, David Benko, Claus Ernst
Publication date: 17 March 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0c2b52afc14d1b6d89d7b49821af64f3107ad35f
05C10: Planar graphs; geometric and topological aspects of graph theory
05C75: Structural characterization of families of graphs
05C40: Connectivity
Related Items
A note on the integrity of grids, Network majority on tree topological network, On the range of possible integrities of graphs \(G(n, k)\), Edge integrity of nearest neighbor graphs and separator theorems, Vulnerability of nearest neighbor graphs, Largest component and node fault tolerance for grids