Xing Peng

activity

20112026

most citedSignless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

11 citations · 12 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2026

Counting triangles in graphs with no wheels of order at least five

Chunyang Dou, Bo Ning, Xing Peng

For a family of graphs $F$ , a graph $G$ is said to be $F$ -free if it contains no member of $F$ as a subgraph. A wheel graph $W_{k}$ is a graph on $k + 1$ ver…

math.CO2023

Turán number of the odd-ballooning of complete bipartite graphs

Xing Peng, Mengjie Xia

Given a graph $L$ , the Turán number $ex (n, L)$ is the maximum possible number of edges in an $n$ -vertex $L$ -free graph. The study of Turán number of graphs is a central top…

math.CO2021

The fractional chromatic number of $K_{Δ}$ -free graphs

Xiaolan Hu, Xing Peng

For a simple graph $G$ , let $χ_{f} (G)$ be the fractional chromatic number of $G$ . In this paper, we aim to establish upper bounds on $χ_{f} (G)$ for those graphs $G$ with restrictions o…

math.CO2019

Large book--cycle Ramsey numbers

Qizhong Lin, Xing Peng

Let $B_{n}^{(k)}$ be the book graph which consists of $n$ copies of $K_{k + 1}$ all sharing a common $K_{k}$ , and let $C_{m}$ be a cycle of length $m$ . In this paper, we first determine th…

math.CO2017★ 11 cited

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

Yawen Li, Yao liu, Xing Peng

In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characteri…

math.CO2011★ 1 cited

Monochromatic 4-term arithmetic progressions in 2-colorings of $Z_{n}$

Linyuan Lu, Xing Peng

This paper is motivated by a recent result of Wolf \cite{wolf} on the minimum number of monochromatic 4-term arithmetic progressions(4-APs, for short) in $Z_{p}$ , where $p$ is a pri…