The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs

DOI10.1016/S0166-218X(98)00050-XzbMath0914.05050OpenAlexW2083720489WikidataQ127674080 ScholiaQ127674080MaRDI QIDQ1270774

E. Garriga, Miquel Àngel Fiol

Publication date: 7 June 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00050-x

zbMATH Keywords

inequalitiesdiameterspectraadjacency polynomialsalternating polynomials

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (9)

On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Characterizing \((\ell ,m)\)-walk-regular graphs ⋮ On the spectra and spectral radii of token graphs ⋮ On almost distance-regular graphs ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ On perturbations of almost distance-regular graphs ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ Eigenvalue interlacing and weight parameters of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Graphs with given diameter maximizing the spectral radius
• Ramanujan graphs
• Locally pseudo-distance-regular graphs
• Feasibility conditions for the existence of walk-regular graphs
• Diameter, covering index, covering radius and eigenvalues
• Eigenvalues, diameter, and mean distance in graphs
• Spectral diameter estimates for \(k\)-regular graphs
• Problems in algebraic combinatorics
• The alternating polynomials and their relation with the spectra and conditional diameters of graphs
• Eigenvalues, eigenspaces and distances to subsets
• An eigenvalue characterization of antipodal distance-regular graphs
• Boundary graphs. II: The limit case of a spectral property
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Upper bounds for eigenvalues of the discrete and continuous Laplace operators
• On a class of polynomials and its relation with the spectra and diameters of graphs
• Isoperimetric Inequalities and Eigenvalues
• Diameters and Eigenvalues
• On the Polynomial of a Graph
• Maximally connected digraphs
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Developments in the theory of graph spectra
• Eigenvalues and the diameter of graphs

This page was built for publication: The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs