Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
classification
🧮 math.CO
keywords
distance-regulareigenvaluegraphshavingsmallestvalencynon-bipartite
read the original abstract
In this paper, we study the non-bipartite distance-regular graphs with valency k and having a smallest eigenvalue at most -k/2.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.