Pattern polynomial graphs

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 gr...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors A Satyanarayana Reddy, Mehta, Shashank K
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 23.06.2011
Subjects
Graphs
Polynomials
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422