Rao Li

activity

20202022

collaborators

3 papers

math.CO2022

Chromatic Number and Hamiltonicity of Graphs

Rao Li

Let $G$ be a $k$ - connected ( $k \geq 2$ ) graph of order $n$ . If $χ (G) \geq n - k$ , then $G$ is Hamiltonian or $K_{k} \lor (K_{k}^{c} \cup K_{n - 2 k})$ with $n \geq 2 k + 1$ , where $χ(G)…

math.CO2021

Spectral Conditions for the Bipancyclic Bipartite Graphs

Rao Li

Let $G = (X, Y; E)$ be a bipartite graph with two vertex partition subsets $X$ and $Y$ . $G$ is said to be balanced if $∣ X ∣ = ∣ Y ∣$ . $G$ is said to be bipancyclic if it contains cycl…

math.CO2020

The Matching Number and Hamiltonicity of Graphs

Rao Li

The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity…