Laplace eigenvalues and bandwidth-type invariants of graphs
- 1 July 1993
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 17 (3) , 393-407
- https://doi.org/10.1002/jgt.3190170313
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- Optimal linear labelings and eigenvalues of graphsDiscrete Applied Mathematics, 1992
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphsDiscrete Mathematics, 1991
- On the second eigenvalue and random walks in randomd-regular graphsCombinatorica, 1991
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- The eigenvalues of random symmetric matricesCombinatorica, 1981
- Graph TheoryPublished by Springer Nature ,1979
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973