The alternating polynomials and their relation with the spectra and conditional diameters of graphs
Authors:
- M.A. FiolMFM.A. Fiol
- E. GarrigaEGE. Garriga
- J.L.A. YebraJYJ.L.A. Yebra
- 15 April 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 167-168, 297-307
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Boundary graphs — II The limit case of a spectral propertyDiscrete Mathematics, 1998
- From regular boundary graphs to antipodal distance-regular graphsJournal of Graph Theory, 1998
- On the connectivity and the conditional diameter of graphs and digraphsNetworks, 1996
- On a Class of Polynomials and Its Relation with the Spectra and Diameters of GraphsJournal of Combinatorial Theory, Series B, 1996
- Spectral Diameter Estimates for k-Regular GraphsAdvances in Mathematics, 1994
- An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its LaplacianSIAM Journal on Discrete Mathematics, 1994
- Eigenvalues, diameter, and mean distance in graphsGraphs and Combinatorics, 1991
- Diameter, Covering Index, Covering Radius and EigenvaluesEuropean Journal of Combinatorics, 1991
- Diameters and eigenvaluesJournal of the American Mathematical Society, 1989
- λ1, Isoperimetric inequalities for graphs, and superconcentratorsJournal of Combinatorial Theory, Series B, 1985