The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs (Q1270774)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs |
scientific article; zbMATH DE number 1218470
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs |
scientific article; zbMATH DE number 1218470 |
Statements
The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs (English)
0 references
7 June 1999
0 references
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.
0 references
adjacency polynomials
0 references
spectra
0 references
alternating polynomials
0 references
inequalities
0 references
diameter
0 references
0 references
0 references
