Xueyi Huang

activity

20212025

k

-trees, perfect matchings and spectral radius of graphs

45 citations · 48 across the 20 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups

Xueyi Huang, Lu Lu, Xiongfeng Zhan

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavič and Potočnik proposed the problem of charaterizing distance-regular Cayl…

math.CO2023

Distance-regular Cayley graphs over $Z_{p^{s}} \oplus Z_{p}$

Xiongfeng Zhan, Lu Lu, Xueyi Huang

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavič and Potočnik proposed the problem of characterizing distance-regular Cay…

math.CO2023★ 2 cited

Spectral condition for spanning $k$ -ended trees in $t$ -connected graphs

Jiaxin Zheng, Xueyi Huang, Junjie Wang

For any integer $k \geq 2$ , a spanning $k$ -ended tree is a spanning tree with at most $k$ leaves. In this paper, we provide a tight spectral radius condition for the existence of a…

math.CO2023

Toughness and normalized Laplacian eigenvalues of graphs

Xueyi Huang, Kinkar Chandra Das, Shunlai Zhu

Given a connected graph $G$ , the toughness $τ_{G}$ is defined as the minimum value of the ratio $∣ S ∣/ ω_{G - S}$ , where $S$ ranges over all vertex cut sets of $G$ , and $ω_{G - S}$ is the…

Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups

Distance-regular Cayley graphs over Zps​⊕Zp​

Spectral condition for spanning k-ended trees in t-connected graphs

Toughness and normalized Laplacian eigenvalues of graphs

Distance-regular Cayley graphs over $Z_{p^{s}} \oplus Z_{p}$

Spectral condition for spanning $k$ -ended trees in $t$ -connected graphs