Skip to content

Author

Hongzhang Chen

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Oct 2026

Bounds on the spectral radius of graphs via subgraph deletion and coalescence

The spectral radius of a graph is a fundamental parameter closelylinked to network dynamics and robustness. Understanding its precisevariation under structural perturbations such as vertex deletion,edge removal, or graph coalescence is a central problem in spectralgraph theory. In this paper, we establish several sharp...

Hongzhang Chen, Jian-Xi Li · 0 citations
Preprint Oct 2026

Optimal spectral supersaturation for cliques and odd cycles

Let $Y_{n,r,q}$ be the graph obtained from the Tur\'an graph $T_{n,r}$ by adding $q$ pairwise disjoint edges inside a largest part, and let $c(n,F)$ be the minimum number of copies of $F$ created by adding a single edge to $T_{n,r}$. Fang, Li, Lin and Ma proved that for every color-critical graph $F$ with $\chi (F)=r+1...

Hongzhang Chen, Yong-Tao Li · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.