• Publications
  • Influence
Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
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 MoserExpand
  • 45
  • 11
  • PDF
The formula for Turán number of spanning linear forests
  • Bo Ning, J. Wang
  • Mathematics, Computer Science
  • Discret. Math.
  • 3 December 2018
TLDR
We prove that the Turan number e x ( n ; F ) is defined to be the maximum number of edges in a graph of order n that is F -free. Expand
  • 5
  • 3
  • PDF
Wiener index, Harary index and Hamiltonicity of graphs
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 someExpand
  • 13
  • 2
  • PDF
On sufficient conditions for rainbow cycles in edge-colored graphs
TLDR
An edge-colored graph G has a rainbow triangle if e ( G ) + c ( G) ≥ n ( n + 1 ) ∕ 2 but contains only one rainbow triangle. Expand
  • 6
  • 2
  • PDF
Stability Results on the Circumference of a Graph
  • J. Ma, Bo Ning
  • Mathematics, Computer Science
  • Comb.
  • 2 August 2017
TLDR
In this paper, we extend and refine previous Turán-type results on graphs with a given circumference. Expand
  • 9
  • 2
  • PDF
Rainbow triangles in edge-colored graphs
TLDR
We give some sufficient conditions for the existence of rainbow triangles in edge-colored graphs in terms of color degree, color number and edge number. Expand
  • 27
  • 1
  • PDF
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
TLDR
We characterize all pairs of forbidden subgraphs that imply a 2-connected graph to be Hamiltonian by restricting Ore- and Fan-type degree conditions. Expand
  • 15
  • 1
  • PDF
Spectral radius and Hamiltonian properties of graphs
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 aExpand
  • 45
  • 1
  • PDF
Spectral analogues of Moon–Moser's theorem on Hamilton paths in bipartite graphs
Abstract In 1962, Erdős proved a theorem on the existence of Hamilton cycles in graphs with given minimum degree and number of edges. Significantly strengthening in case of balanced bipartite graphs,Expand
  • 21
  • 1
  • PDF
Spectral radius and traceability of connected claw-free graphs
Let $G$ be a connected claw-free graph on $n$ vertices and $\overline{G}$ be its complement graph. Let $\mu(G)$ be the spectral radius of $G$. Denote by $N_{n-3,3}$ the graph consisting of $K_{n-3}$Expand
  • 16
  • 1
  • PDF
...
1
2
3
4
5
...