Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs

DOI10.1137/070692698zbMath1193.05103OpenAlexW1979822069MaRDI 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

zbMATH Keywords

planar graphsvulnerabilityseparatorsintegritylattice graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (6)

Largest component and node fault tolerance for grids ⋮ A note on the integrity of grids ⋮ Vulnerability of nearest neighbor graphs ⋮ On the range of possible integrities of graphs \(G(n, k)\) ⋮ Network majority on tree topological network ⋮ Edge integrity of nearest neighbor graphs and separator theorems

This page was built for publication: Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs