Jiadong Wu

works on

edge-color-critical graphs 1 multipartite classification 1 non-r-partite graphs 1 spectral extremal graph theory 1 Turán graphs 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

A reduction principle for non- $r$ -partite spectral extremal problems, with a complete multipartite classification

Suil O, Jiadong Wu

The paper proves a reduction principle that converts spectral extremal problems for non‑r‑partite, edge‑color‑critical forbidden graphs into edge‑counting problems, and uses it to…

math.CO2026

The signless Laplacian spectral TurÃ¡n problems for hypergraphs

Yongchun Lu, Jiadong Wu, Liying Kang

Let $H = (V, E)$ be an $r$ -uniform hypergraph on $n$ vertices. The signless Laplacian spectral radius of $H$ is defined as the maximum modulus of the eigenvalues…

math.CO2025

The $I^\pm$ -spectral TurÃ¡n type problems for graphs

Jiadong Wu, Yongchun Lu, Liying Kang

For $0 \leq I^\pm < 1$ , the $I^\pm$ -spectral radius of a graph $G$ is defined as the largest eigenvalue of $A_{I^} \pm (G) = I^\pm D (G) + (1 - I^\pm) A (G)$ , where $D (G)$ and $A (G)$ are the diagonal matrix of…

math.CO2025

Spectral extremal problems for degenerate graphs

Jiadong Wu, Liying Kang, Zhenyu Ni

A family of graphs is called degenerate if it contains at least one bipartite graph. In this paper, we investigate the spectral extremal problems for a degenerate family of graphs…

A reduction principle for non-r-partite spectral extremal problems, with a complete multipartite classification

The signless Laplacian spectral TurÃ¡n problems for hypergraphs

The I^±-spectral TurÃ¡n type problems for graphs

Spectral extremal problems for degenerate graphs

A reduction principle for non- $r$ -partite spectral extremal problems, with a complete multipartite classification

The $I^\pm$ -spectral TurÃ¡n type problems for graphs