Yuefeng Yang

activity

20242026

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2026

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks

Chang Liu, Ruichao Niu, Yuefeng Yang

Let $r_{1}$ and $r_{2}$ be positive integers with $r_{1} \leq r_{2}$ . A graph $G$ is called $2$ -DCC vertex $[r_{1}, r_{2}]$ -pancyclic if, for any two distinct vertices of $G$ and any integer $\e…

math.CO2025

Weakly distance-regular digraphs of diameter 2

Xiangli Wang, Yuefeng Yang

Weakly distance-regular digraphs is a directed version of distance-regular graphs. In this paper, we characterize all weakly distance-regular digraphs of diameter 2.

math.CO2025

Semicomplete multipartite weakly distance-regular digraphs

Shuang Li, Yuefeng Yang, Kaishun Wang

A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, JÃ¸rgensen et al. \cite{JG…

math.CO2024

Locally semicomplete weakly distance-regular digraphs

Yuefeng Yang, Shuang Li, Kaishun Wang

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…

math.CO2024

Weakly distance-regular digraphs whose underlying graphs are distance-regular,II

Qing Zeng, Yuefeng Yang, Kaishun Wang

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…

math.CO2024

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 $I^$ is called a perfect code of $I^$ if every vertex of $I^$ is at distance no more than one to exactly one vertex in $C$ . In this paper,…