Eigenvalues, diameter, and mean distance in graphs
- 1 March 1991
- journal article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 7 (1) , 53-64
- https://doi.org/10.1007/bf01789463
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Isoperimetric numbers of graphsJournal of Combinatorial Theory, Series B, 1989
- Diameters and eigenvaluesJournal of the American Mathematical Society, 1989
- Characteristic vertices of trees*Linear and Multilinear Algebra, 1987
- Transportation in graphs and the admittance spectrumDiscrete Applied Mathematics, 1987
- Algebraic connectivity of treesCzechoslovak Mathematical Journal, 1987
- Eigenvalues and expandersCombinatorica, 1986
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985
- Explicit Concentrators from Generalized N-GonsSIAM Journal on Algebraic Discrete Methods, 1984
- A property of eigenvectors of nonnegative symmetric matrices and its application to graph theoryCzechoslovak Mathematical Journal, 1975
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973