Vulnerability of nearest neighbor graphs

DOI10.1016/j.dam.2014.02.021zbMath1288.05143OpenAlexW2084719649MaRDI QIDQ2449104

Molly Dunkum, Dominic Lanphier

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.02.021

zbMATH Keywords

tenacitytoughnessseparatorsintegrityscattering numberrupture degree

Mathematics Subject Classification ID

Graph theory (05C99) Connectivity (05C40)

Related Items

Edge integrity of nearest neighbor graphs and separator theorems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tenacity of a graph with maximum connectivity
• Highly connected random geometric graphs
• On a class of posets and the corresponding comparability graphs
• Logarithmic convexity and inequalities for the gamma function
• Toughness in graphs -- a survey
• Isoperimetric numbers of graphs
• A separator theorem for graphs of bounded genus
• A Separator Theorem for Planar Graphs
• A Separator Theorem for Nonplanar Graphs
• Planar Separators
• Separators for sphere-packings and nearest neighbor graphs
• Geometric Separators for Finite-Element Meshes
• Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
• Rupture degree of graphs