Bo Ning

activity

20112026

most citedEigenvalues and triangles in graphs

84 citations · 579 across the 67 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

7 papers · 2 filters

math.CO2013

The Ramsey numbers of paths versus wheels: a complete solution

Binlong Li, Bo Ning

Let $G_{1}$ and $G_{2}$ be two given graphs. The Ramsey number $R (G_{1}, G_{2})$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_{1}$ or $\ove…

math.CO2013★ 65 cited

Spectral radius and Hamiltonian properties of graphs

Bo Ning, Jun Ge

Let $G$ be a graph with minimum degree $δ$ . The spectral radius of $G$ , denoted by $ρ (G)$ , is the largest eigenvalue of the adjacency matrix of $G$ . In this note we mainly prove th…

math.CO2013

Hamilton cycles in almost distance-hereditary graphs

Bing Chen, Bo Ning

Let $G$ be a graph on $n \geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H} (x, y) \leq d_{G} (x, y) + 1$ for…

math.CO2013★ 6 cited

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity

Bo Ning

In 1984, Fan gave a sufficient condition involving maximum degree of every pair of vertices at distance two for a graph to be Hamiltonian. Motivated by Fan's result, we say that an…

math.CO2013★ 4 cited

Rainbow C_4's and Directed C_4's: the Bipartite Case Study

Bo Ning, Jun Ge

In this paper we obtain a new sufficient condition for the existence of directed cycles of length 4 in oriented bipartite graphs. As a corollary, a conjecture of H. Li is confirmed…

math.CO2013★ 4 cited

Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs

Bo Ning

A graph $G$ on $n$ vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to $n$ . In 1984, Fan presented a degree condit…