Let Γ be a graph on n vertices, adjacency matrix A, and distinct eigenvalues λ > λ_1 > λ_2 > · · · > λ_d. For every k = 0,1, . . . ,d −1, the k-alternating polynomial P_k is defined to be the polynomial of degree k and norm |
CitationFiol Mora, Miquel Àngel; Garriga Valle, Ernest. "The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs". Discrete Applied Mathematics, 1998, vol. 87, núm. 1-3, p. 77-97.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com