Pattern polynomial graphs

A. Satyanarayana Reddy ()
Additional contact information
A. Satyanarayana Reddy: Shiv Nadar Institution of Eminence

Indian Journal of Pure and Applied Mathematics, 2024, vol. 55, issue 4, 1302-1315

Abstract: Abstract 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.

Keywords: Adjacency Algebra of a Graph; Coherent Algebra; Automorphism of a Graph; Distance Regular Graph; 05C31; 05C50; 05E40; 05E18 (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-023-00439-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00439-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-023-00439-6

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().