Main eigenvalues and automorphisms of a graph

We study some aspects of the relationship between algebras associated with graphs and automorphism groups. We study an algebra generated by the adjacent matrix of a graph and the all ones matrix, and derive a lower bound for the rank of the automorphism group of a graph. If a graph attains the equality in the above bound, it is calledextremal. We also describe some properties and examples of extremal graphs.