1 paper · 1 filter
A. Satyanarayana Reddy, Shashank K Mehta
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…