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

The authors use \(k\)-alternating polynomials (introduced by the authors and \textit{J. L. A. Yebra} in [J. Comb. Theory, Ser. B 67, No. 1, 48-61, Art. No. 0033 (1996; Zbl 0857.05101)]) and the newly defined \(\tau\)-adjacency polynomials to obtain spectrally based inequalities for the diameter and some related invariants of a graph.