On a class of polynomials and its relation with the spectra and diameters of graphs
From MaRDI portal
Publication:1924137
DOI10.1006/jctb.1996.0033zbMath0857.05101OpenAlexW2001247565MaRDI QIDQ1924137
E. Garriga, J. Luis A. Yebra, Miquel Àngel Fiol
Publication date: 14 October 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0033
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (max. 100)
On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ Pseudo-Strong Regularity Around a Set ⋮ The alternating polynomials and their relation with the spectra and conditional diameters of graphs ⋮ Eigenvalues, eigenspaces and distances to subsets ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ Boundary graphs. II: The limit case of a spectral property ⋮ Bounds on special subsets in graphs, eigenvalues and association schemes ⋮ A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number ⋮ A spectral excess theorem for nonregular graphs ⋮ A characterization of bipartite distance-regular graphs ⋮ Shortest paths in distance-regular graphs ⋮ Spectral bounds and distance-regularity ⋮ 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 ⋮ On the \(k\)-independence number of graphs ⋮ 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 ⋮ On Middle Cube Graphs
This page was built for publication: On a class of polynomials and its relation with the spectra and diameters of graphs
