2 citations · 2 across the 6 of their papers we have counts for
6 papers
On oriented -semiregular representations of finite groups
Jia-Li Du, Yan-Quan Feng, Sejeong Bang
A finite group admits an {\em oriented regular representation} if there exists a Cayley digraph of such that it has no digons and its automorphism group is isomorphic to $G…
Distance-regular graphs without 4-claws
Sejeong Bang, Alexander Gavrilyuk, Jack Koolen
We determine the distance-regular graphs with diameter at least and but without induced -subgraphs.
A bijection between aperiodic palindromes and connected circulant graphs
Hunki Baek, Sejeong Bang, Dongseok Kim +1
In this paper, we show that there is a one-to-one correspondence between the set of compositions (resp. prime compositions) of and the set of circulant digraphs (resp. connecte…
Geometric distance-regular graphs without 4-claws
Sejeong Bang
A non-complete \drg is called geometric if there exists a set of Delsarte cliques such that each edge of lies in a unique clique in . In this pap…
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.
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…