Isoperimetric numbers of graph bundles
From MaRDI portal
Publication:1923779
DOI10.1007/BF01858458zbMath0865.05050MaRDI QIDQ1923779
Moo Young Sohn, Jaeun Lee, Jin Ho Kwok
Publication date: 29 June 1997
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items
On strong graph bundles ⋮ Graph bundles and Ricci‐flatness ⋮ Partitioning a graph into defensive \(k\)-alliances ⋮ On the isoperimetric number of a \(k\)-degree Cayley graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Isoperimetric inequalities and Markov chains
- Signatures and signed switching classes
- The maximum genus of graph bundles
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Balancing signed graphs
- Generating all graph coverings by permutation voltage assignments
- Isoperimetric numbers of graphs
- Caracteristics polynomials of some grap bundlesII
- An Isoperimetric Inequality on the Discrete Torus
- Isomorphism Classes of Graph Bundles
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
This page was built for publication: Isoperimetric numbers of graph bundles
