Isoperimetric numbers of graphs
- 1 December 1989
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 47 (3) , 274-291
- https://doi.org/10.1016/0095-8956(89)90029-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Isoperimetric inequalities, growth, and the spectrum of graphsLinear Algebra and its Applications, 1988
- The Spectral Radius of infinite GraphsBulletin of the London Mathematical Society, 1988
- Isoperimetric inequalities and Markov chainsJournal of Functional Analysis, 1985
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- On the bipartition of graphsDiscrete Applied Mathematics, 1984
- Difference equations, isoperimetric inequality and transience of certain random walksTransactions of the American Mathematical Society, 1984
- Edge disjoint placement of graphsJournal of Combinatorial Theory, Series B, 1978
- Cubic graphs and the first eigenvalue of a Riemann surfaceMathematische Zeitschrift, 1978
- Subgraphs of graphs, IDiscrete Mathematics, 1974