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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Indian journal of pure and applied mathematics 2024, Vol.55 (4), p.1302-1315
1. Verfasser: Reddy, A. Satyanarayana
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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:0019-5588
0975-7465
DOI:10.1007/s13226-023-00439-6