H. Zeng

collaborators

4 papers

math.CO2026

Clique spectral extremal problem on disjoint color-critical graphs

Changjiang Bu, Peiyan Wei, Haotian Zeng

For a given graph $F$ , a graph $G$ is called $F$ -free if it does not contain $F$ as a subgraph. A graph is color-critical if deleting one of its edges decreases its chromatic numbe…

cs.SI2026

The eigenvector centrality of hypergraphs

Changjiang Bu, Haotian Zeng, Qingying Zhang

A hypergraph is called uniform when every hyperedge contains the same number of vertices, otherwise, it is called non-uniform. In the real world, many systems give rise to non-unif…

math.CO2026

The high order spectral extrema of $2 K_{r}$ -free graphs

Changjiang Bu, Yifan Sun, Haotian Zeng

In this paper, we determine the graphs with maximum value of the sum number from $k$ -clique spectral radius to $(2 r - 1)$ -clique spectral radius among all $2 K_{r}$ -free graphs on $n$ …

math.CO2026

Localization of the clique spectral version of Zykov's theorem

Changjiang Bu, Jueru Liu, Haotian Zeng

Zykov's theorem shows that $r$ -partite Turán graph uniquely has the maximum number of $K_{t}$ among all $n$ -vertex $K_{r + 1}$ -free graphs for $2 \leq t \leq r$ . The clique tensor is a hig…

Clique spectral extremal problem on disjoint color-critical graphs

The eigenvector centrality of hypergraphs

The high order spectral extrema of 2Kr​-free graphs

Localization of the clique spectral version of Zykov's theorem

The high order spectral extrema of $2 K_{r}$ -free graphs