Yuefeng Yang

activity

20232026

collaborators

6 papers

math.CO2026

Spectral bounds for distance coloring and packing parameters of graphs via semidefinite programming

Aida Abiad, Yue Yang, Jiang Zhou

Using methods from spectral graph theory and semidefinite programming, we obtain sharp spectral bounds for several graph parameters related to distance colorings and packing, inclu…

math.CO2025

Regular sets in Cayley sum graphs on generalized dicyclic groups

Meiqi Peng, Yuefeng Yang

For a graph $Γ = (V (Γ), E (Γ))$ , a subset $C$ of $V (Γ)$ is called an $(α, β)$ -regular set in $Γ$ , if every vertex of $C$ is adjacent to exactly $α$ vertices of $C$ and every vertex of $…

math.CO2025

Perfect codes in quartic Cayley graphs of generalized dihedral groups

Chengcheng Dong, Yuefeng Yang, Changchang Dong

For a graph $Γ = (V Γ, E Γ)$ , a subset $D$ of $V Γ$ is a perfect code in $Γ$ if every vertex of $Γ$ is dominated by exactly one vertex in $D$ . In this paper, we classify all connected qu…

math.CO2024

(Total) Perfect codes in (extended) subgroup sum graphs

Xuanlong Ma, Yuefeng Yang, Liangliang Zhai

Given a finite group $G$ with identity $e$ and a normal subgroup $H$ of $G$ , the subgroup sum graph $Γ_{G, H}$ (resp. extended subgroup sum graph $Γ_{G, H}^{+}$ ) of $G$ with respect to…

math.CO2024

Every nonsymmetric $4$ -class association scheme can be generated by a digraph

Yuefeng Yang

A (di)graph $Γ$ generates a commutative association scheme $X$ if and only if the adjacency matrix of $Γ$ generates the Bose-Mesner algebra of $X$ . In [17, Th…

math.CO2023

Perfect codes in 2-valent Cayley digraphs on abelian groups

Shilong Yu, Yuefeng Yang, Yushuang Fan +1

For a digraph $Γ$ , a subset $C$ of $V (Γ)$ is a perfect code if $C$ is a dominating set such that every vertex of $Γ$ is dominated by exactly one vertex in $C$ . In this paper, we cl…