Pattern polynomial graphs
A.Satyanarayana Reddy, Shashank K Mehta
TL;DR
This paper characterizes pattern polynomial graphs by establishing necessary and sufficient conditions for a graph to belong to this class, and explores properties and known classes related to these graphs.
Contribution
It provides a complete characterization of pattern polynomial graphs and studies properties of graphs derived from them, identifying known classes as examples.
Findings
Characterization of pattern polynomial graphs with necessary and sufficient conditions
Properties of graphs polynomial in pattern polynomial graphs
Identification of known graph classes as pattern polynomial graphs
Abstract
A graph 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Topics in Algebra