A table of connected graphs on six vertices

Abstract

This paper contains a table of 112 connected graphs on six vertices. The graphs are ordered lexicographically by their spectral moments in non-increasing order. The pictures of graphs are given to show as much symmetry as possible. Several data such as the spectrum, and its main part, coefficients of the characteristic and of the matching polynomial, numbers of circuits, etc., are given for each graph in the table. Several observations implied by this table are noted. © 1984.