The degrees, number of edges, spectral radius and weakly Hamilton-connectedness of bipartite graphs

Jia Wei, Zhifu You

A path of a graph $G$ is called a Hamilton path if it passes through all the vertices of $G$. A graph is Hamilton-connected if any two vertices are connected by a Hamilton path. No…