The group and the minimal polynomial of a graph

This paper presents some results linking the minimal polynomila of the adjacency matrix of a graph with its group structure. An upper bound on the order of the group is derived for graphs whose minimal and characteristic polynomials are identical. It is also shown that for a graph with transitive group, the degree of the minimal polynomial is bounded above by the number of orbits of the stabilizer of any given element. Finally, the order of the group of a point-symmetric graph with a prime number of points is shown to depend on the degree of the minimal polynomial, and an algorithm for constructing such a group is given.