2 citations · 2 across the 4 of their papers we have counts for
4 papers
Isomorphism classes of association schemes induced by Hadamard matrices
Mitsugu Hirasaka, Kijung Kim, Hyonju Yu
Every Hadamard matrix of order induces a graph with vertices, called the Hadamard graph of . Since is a distance-regular graph with diameter ,…
On the limit points of the smallest eigenvalues of regular graphs
Hyonju Yu
In this paper, we give infinitely many examples of (non-isomorphic) connected -regular graphs with smallest eigenvalue in half open interval and also infinitel…
The distance-regular graphs such that all of its second largest local eigenvalues are at most one
Jack H. Koolen, Hyonju Yu
In this paper, we classify distance regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenval…
An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
Jack H. Koolen, Jongyook Park, Hyonju Yu
For a distance-regular graph with second largest eigenvalue (resp. smallest eigenvalue) \mu1 (resp. \muD) we show that (\mu1+1)(\muD+1)<= -b1 holds, where equality only holds when…