Yongbin Gao

collaborators

4 papers

math.CO2026

Some results on the distance spectral radius and edge-disjoint spanning trees of graphs

Yongbin Gao, Ligong Wang

Let $τ (G)$ denote the maximum number of edge-disjoint spanning trees in a connected graph $G$ of order $n$ , and let $ρ_{D} (G)$ denote its distance spectral radius. For an integer $k\…

math.CO2026

Spectral radius conditions for edge-disjoint spanning trees in $(k + c)$ -edge-connected graphs

Yongbin Gao, Ligong Wang

Let $τ (G)$ denote the spanning tree packing number of a graph $G$ . Recently, Zhang and Fan [J. Graph Theory 112 (2) (2026) 128--144] posed the problem of finding a tight spectral r…

math.CO2026

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints

Yongbin Gao, Ligong Wang

Let $k \geq 2$ be a positive integer and let $G$ be a simple graph of order $n$ with minimum degree $δ$ . A graph $G$ is said to have property $P (k, d)$ if it contains $k$ edge-disjoi…

math.CO2026

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints

Yongbin Gao, Ligong Wang

Let $k$ be a positive integer and let $G$ be a simple graph of order $n$ with minimum degree $δ$ . A graph $G$ is said to have property $P (k, d)$ if it contains $k$ edge-disjoint sp…

Some results on the distance spectral radius and edge-disjoint spanning trees of graphs

Spectral radius conditions for edge-disjoint spanning trees in (k+c)-edge-connected graphs

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints

Spectral radius conditions for edge-disjoint spanning trees in $(k + c)$ -edge-connected graphs