Eigenvalues, diameter, and mean distance in graphs
From MaRDI portal
Publication:1175553
DOI10.1007/BF01789463zbMath0771.05063MaRDI QIDQ1175553
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05C38: Paths and cycles
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C12: Distance in graphs
Related Items
Algebraic connectivity of weighted trees under perturbation, Bounds on the subdominant eigenvalue involving group inverse with applications to graphs, A survey of graph laplacians, Eigenvalues and the diameter of graphs, From ternary strings to Wiener indices of benzenoid chains, Laplace eigenvalues of graphs---a survey, Mechanisms for local search, The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs, Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods, Laplacian matrices of graphs: A survey, Computing the average distance of an interval graph, The alternating polynomials and their relation with the spectra and conditional diameters of graphs, From local adjacency polynomials to locally pseudo-distance-regular graphs, A new upper bound for the isoperimetric number of de Bruijn networks, Boundary graphs. II: The limit case of a spectral property, A Wiener-type graph invariant for some bipartite graphs, Shortest paths in distance-regular graphs, Perron components and algebraic connectivity for weighted graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Transportation in graphs and the admittance spectrum
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Eigenvalues and expanders
- Isoperimetric numbers of graphs
- Explicit Concentrators from Generalized N-Gons
- Diameters and Eigenvalues
- Characteristic vertices of trees*
