3 citations · 3 across the 3 of their papers we have counts for
3 papers
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 $…
math.NT2011★ 3 cited
Non-singular circulant graphs and digraphs
A. K. Lal, A. Satyanarayana Reddy
We give necessary and sufficient conditions for a few classes of known circulant graphs and/or digraphs to be singular. The above graph classes are generalized to -digraph…