- Print publication year: 2009
- Online publication date: February 2011

- Publisher: Cambridge University Press
- DOI: https://doi.org/10.1017/CBO9780511801518.011
- pp 285-332

This Appendix contains the following graph tables:

A1. The spectra and characteristic polynomials of the adjacency matrix, Seidel matrix, Laplacian and signless Laplacian for connected graphs with at most 5 vertices;

A2. The eigenvalues, angles and main angles of connected graphs with 2 to 5 vertices;

A3. The spectra and characteristic polynomials of the adjacency matrix for connected graphs with 6 vertices;

A4. The spectra and characteristic polynomials of the adjacency matrix for trees with at most 9 vertices;

A5. The spectra and characteristic polynomials of the adjacency matrix for cubic graphs with at most 12 vertices.

In Tables A1 and A2, the graphs are given in the same order as in Table 1 in the Appendix of [CvDSa]. In Table A1, the spectra and coefficients for the characteristic polynomials with respect to the adjacency matrix, Laplacian, signless Laplacian and Seidel matrix, appear in consecutive lines. Table A2, which is taken from [CvPe2], was also published in [CvRS3]. This table contains, for each graph, the eigenvalues (first line), the main angles (second line) and the vertex angle sequences, with vertices labelled as in the diagrams alongside. Vertices of graphs in Table A2 are ordered in such a way that the corresponding vertex angle sequences are in lexicographical order. Since similar vertices have the same angle sequence, just one sequence is given for each orbit.