2011/06/23 by A. Satyanarayana Reddy, Reddy, A. Satyanarayana, Shashank K. Mehta +2
Mathematics · #05C50 #05E18 #05E40 #Advanced Topics in Algebra #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C50 #msc:05E18 #msc:05E40
paper · pdf · doi:10.48550/arxiv.1106.4745
19 pages and 1 figure
arxiv created 2011/06/23 · openalex publication_date 2011/06/23 · arxiv updated 2011/06/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.