3 papers
math.CO2026
Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
Chang Liu, Ruichao Niu, Yuefeng Yang
Let and be positive integers with . A graph is called -DCC vertex -pancyclic if, for any two distinct vertices of 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…