The alternating polynomials and their relation with the spectra and conditional diameters of graphs
From MaRDI portal
Publication:1356468
DOI10.1016/S0012-365X(96)00235-XzbMath0877.05017OpenAlexW2041997641WikidataQ126782660 ScholiaQ126782660MaRDI QIDQ1356468
E. Garriga, Miquel Àngel Fiol, J. Luis A. Yebra
Publication date: 8 December 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00235-x
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (7)
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods ⋮ Eigenvalue interlacing and weight parameters of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Diameter, covering index, covering radius and eigenvalues
- Eigenvalues, diameter, and mean distance in graphs
- Spectral diameter estimates for \(k\)-regular graphs
- Boundary graphs. II: The limit case of a spectral property
- Boundary graphs: The limit case of a spectral property
- On a class of polynomials and its relation with the spectra and diameters of graphs
- Diameters and Eigenvalues
- From regular boundary graphs to antipodal distance-regular graphs
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
- Eigenvalues and the diameter of graphs
This page was built for publication: The alternating polynomials and their relation with the spectra and conditional diameters of graphs
