3 citations · 5 across the 5 of their papers we have counts for
5 papers
An algorithm for computing cutpoints in finite metric spaces
A. Dress, K. T. Huber, J. Koolen +2
The theory of the tight span, a cell complex that can be associated to every metric , offers a unifying view on existing approaches for analyzing distance data, in particular fo…
There are only finitely many distance-regular graphs of fixed valency greater than two
S. Bang, A. Dubickas, J. H. Koolen +1
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
Bounds for the Huckel energy of a graph
Ebrahim Ghorbani, Jack H. Koolen, Jae Young Yang
Let be a graph on vertices with and let be adjacency eigenvalues of . Then the Hückel energy of , HE(), is defi…
On Distance-Regular Graphs with Smallest Eigenvalue at Least
J. H. Koolen, S. Bang
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fi…
Shilla distance-regular graphs
Jack H. Koolen, Jongyook Park
A Shilla distance-regular graph G (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divide…