2 papers
math.CO2026
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Jia Wei, Muhuo Liu, Zhifu You +1
Let denote the maximum number of pairwise edge-disjoint spanning trees contained in a graph . Zhang and Fan [J. Graph Theory, 2026] posed the problem of determining the c…
math.CO2018
The degrees, number of edges, spectral radius and weakly Hamilton-connectedness of bipartite graphs
Jia Wei, Zhifu You
A path of a graph is called a Hamilton path if it passes through all the vertices of . A graph is Hamilton-connected if any two vertices are connected by a Hamilton path. No…