Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Koolen, J. H."'
Autor:
Greaves, Gary R. W., Koolen, J. H.
We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$. We also show that edge-
Externí odkaz:
http://arxiv.org/abs/1810.07454
Publikováno v:
J. Combin. Theory Ser. A 138 (2016), pp. 208--235
We obtain several new results contributing to the theory of real equiangular line systems. Among other things, we present a new general lower bound on the maximum number of equiangular lines in d dimensional Euclidean space; we describe the two-graph
Externí odkaz:
http://arxiv.org/abs/1403.2155
We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of the eigen
Externí odkaz:
http://arxiv.org/abs/0911.1828
Publikováno v:
Discrete Math. Theor. Comput. Sci. 17 (2016) 59-76
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order
Externí odkaz:
http://arxiv.org/abs/0911.1826
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.
Comment: 51 pages
Comment: 51 pages
Externí odkaz:
http://arxiv.org/abs/0909.5253
Autor:
Koolen, J. H., Bang, S.
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 fixed integer $m\geq 2$, there are only finitely many non-geometric dist
Externí odkaz:
http://arxiv.org/abs/0908.2017
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
van Dam, E. R.1 Edwin.vanDam@uvt.nl, Koolen, J. H.2 koolen@postech.ac.kr
Publikováno v:
Inventiones Mathematicae. Oct2005, Vol. 162 Issue 1, p189-193. 5p.
Publikováno v:
Kyushu Journal of Mathematics. 52(2):265-277
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::db9792f450090fe8f8e7e8f1e35f8cb6
http://hdl.handle.net/2324/11554
http://hdl.handle.net/2324/11554
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.