We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
Zero Forcing Sets and Bipartite Circulants
The dimensions of LU(3,q) codes
![QR code for arXiv:0705.3457 [math.CO]](http://oss.arxitics.com/images/favicon.svg)