Xiaofeng Gu

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

Spanning tree packing and 2-essential edge-connectivity

Xiaofeng Gu, Runrun Liu, Gexin Yu

An edge (vertex) cut $X$ of $G$ is $r$ -essential if $G - X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$ -essentially $k$ -edge-connected (resp. $k$ -conn…

math.CO2022

Spectral radius and edge-disjoint spanning trees

Dandan Fan, Xiaofeng Gu, Huiqiu Lin

The spanning tree packing number of a graph $G$ , denoted by $τ (G)$ , is the maximum number of edge-disjoint spanning trees contained in $G$ . The study of $τ (G)$ is one of the classi…