Yuefeng Yang

activity

20152026

most citedWeakly distance-regular digraphs of valency three, I

8 citations · 14 across the 17 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

$P$ -polynomial weakly distance-regular digraphs

Qing Zeng, Yuefeng Yang, Kaishun Wang

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.

math.CO2022

Perfect codes in quintic Cayley graphs on abelian groups

Yuefeng Yang, Xuanlong Ma, Qing Zeng

A subset $C$ of the vertex set of a graph $Γ$ is called a perfect code of $Γ$ if every vertex of $Γ$ is at distance no more than one to exactly one vertex in $C$ . In this paper, we…

P-polynomial weakly distance-regular digraphs

Perfect codes in quintic Cayley graphs on abelian groups

$P$ -polynomial weakly distance-regular digraphs