  A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra
is a coherent algebra. In this study we will find a necessary and sufficient
condition for a graph to be a pattern polynomial graph. Some of the properties
of the graphs which are polynomials in the pattern polynomial graph have been
studied. We also identify known graph classes which are pattern polynomial
graphs.
