A Note on Edge Isoperimetric Numbers and Regular Graphs

DOI10.1142/S0129054116500283zbMath1352.05102arXiv1601.05190OpenAlexW2962870233MaRDI QIDQ5298314

Édouard Bonnet, Florian Sikora

Publication date: 14 December 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.05190

zbMATH Keywords

regular graphsedge isoperimetric problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (3)

Pull-push method: a new approach to edge-isoperimetric problems ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ New infinite family of regular edge-isoperimetric graphs

Cites Work

• Edge-isoperimetric problems for Cartesian powers of regular graphs
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

This page was built for publication: A Note on Edge Isoperimetric Numbers and Regular Graphs