Zobrazeno 1 - 10
of 222
pro vyhledávání: '"Yang, Yuefeng"'
Autor:
Yang, Yuefeng
A (di)graph $\Gamma$ generates a commutative association scheme $\mathfrak{X}$ if and only if the adjacency matrix of $\Gamma$ generates the Bose-Mesner algebra of $\mathfrak{X}$. In [17, Theorem 1.1], Monzillo and Penji\'{c} proved that, except for
Externí odkaz:
http://arxiv.org/abs/2409.00692
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [16], we classified all commutative weakly distance-regular digraphs whose underlying graphs are Hamming graphs, folded n-cubes, or Doob graphs. In this pa
Externí odkaz:
http://arxiv.org/abs/2408.02931
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood (resp. in-neighbourhood) of any vertex induces a semicomplete digraph. In this paper, we characterize all locally sem
Externí odkaz:
http://arxiv.org/abs/2405.03310
For a digraph $\Gamma$, a subset $C$ of $V(\Gamma)$ is a perfect code if $C$ is a dominating set such that every vertex of $\Gamma$ is dominated by exactly one vertex in $C$. In this paper, we classify strongly connected 2-valent Cayley digraphs on a
Externí odkaz:
http://arxiv.org/abs/2310.19017
We classify certain non-symmetric commutative association schemes. As an application, we determine all the weakly distance-regular circulants of one type of arcs by using Schur rings. We also give the classification of primitive weakly distance-regul
Externí odkaz:
http://arxiv.org/abs/2307.12710
Weakly distance-regular digraphs are a natural directed version of distance-regular graphs. In [8], the third author and Suzuki proposed a question when an orientation of a distance-regular graph defines a weakly distance-regular digraph. In this pap
Externí odkaz:
http://arxiv.org/abs/2305.00276
A weakly distance-regular digraph is $P$-polynomial if its attached scheme is $P$-polynomial. In this paper, we characterize all $P$-polynomial weakly distance-regular digraphs.
Externí odkaz:
http://arxiv.org/abs/2210.16121
A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code of $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$. In this paper, we classify all connected quintic Cayley graphs on abelia
Externí odkaz:
http://arxiv.org/abs/2207.06743
Publikováno v:
In Discrete Applied Mathematics 15 November 2024 357:236-240
In this paper, we classify all commutative weakly distance-regular digraphs of girth $g$ and one type of arcs under the assumption that $p_{(1,g-1),(1,g-1)}^{(2,g-2)}\geq k_{1,g-1}-2$. In consequence, we recover [13, Theorem 1.1] as a special case of
Externí odkaz:
http://arxiv.org/abs/2108.00613