arXiv (All)
open access
The edge-isoperimetric number of graphs and their powers
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or geometric structure, including distance-regular graphs and graphs
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Parallel Spectral Graph Sparsification via Low Diameter Decompositions#411014
- 16 U.S.C. § 471e — Extension of boundaries of Sequoia National Forest#570396
- Nakajima-extremal Artin--Schreier covers of ordinary elliptic curves in characteristic $2$#1084748
- Vertex Dismissibility and Scalability of Simplicial Complexe#924519
- Vertex Dismissibility and Scalability of Simplicial Complexe#920288
Record · ID 1118466
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive