In 1962, Erdős gave a sufficient condition for Hamilton cycles in terms of the vertex number, edge number and minimum degree of graphs which generalized Ore’s theorem. One year later, Moon and Moser… Expand

It is proved that every non-bipartite graph of order and size contains a triangle if one of the following is true: $(G) \ge \sqrt {m - 1} $ and $G \ne {C_5} \cup (n - 5){K_1}$.Expand

In this paper, we prove tight sufficient conditions for traceability and Hamiltonicity of connected graphs with given minimum degree, in terms of Wiener index and Harary index. We also prove some… Expand

Let be a graph with minimum degree . The spectral radius of , denoted by , is the largest eigenvalue of the adjacency matrix of . In this note, we mainly prove the following two results.(1) Let be a… Expand

This paper proves that an edge-colored graph on n vertices contains a rainbow triangle if the color degree sum of every two adjacent vertices is at least $$n-1$$n+1.Expand