1 citations · 1 across the 7 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Pattern polynomial graphs
A. Satyanarayana Reddy, Shashank K Mehta
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…
math.NT2011
Representation of Cyclotomic Fields and Their Subfields
A. Satyanarayana Reddy, Shashank K Mehta, A. K. Lal
Let $\K$ be a finite extension of a characteristic zero field $\F$. We say that the pair of matrices over $\F$ represents $\K$ if $\K \cong \F[A]/< B >$ where $…