Chaochao Zhu

activity

20192026

collaborators

6 papers

math.CO2026

A Characterization of Walk-Matrix Equivalence at Corank Two via Reciprocal WQH Switching

Chaochao Zhu, Qin Yue

Let $G$ be a graph of order $n$ with adjacency matrix $A_{G}$ , let $e$ denote the all-one vector, and let $W_{G} = [e, A_{G} e, \dots, A_{G}^{n - 1} e]$ be its walk…

math.CO2026

The Distance Between the Adjacency Spectral Center and the Characteristic Set of a Tree

Chaochao Zhu, Shipei Hu, Jingfu Huang +1

Let $S (T)$ be the adjacency spectral center of a tree $T$ , and let $C (T)$ be its characteristic set. We determine the largest possible separation $d(T) := \operat…

math.CO2026

Main-Factor Allocation and Coronal Realizability for Generalized Cospectral Mates of Trees

Chaochao Zhu

We study how irreducible factors associated with main eigenvalues constrain the connected components of generalized cospectral mates. Let $M_{G} (x)$ be the main polynomial of a graph…

math.CO2026

A Sharp Matching-Number Threshold for Spectral-Walk Determination of Trees

Chaochao Zhu

The spectral characterization of graphs is a central problem in spectral graph theory. In this paper we study when a tree is determined, among trees, by its generalized spectrum. W…

math.CO2025

Single-exponential bounds for diagonals of D-finite power series

Shaoshi Chen, Frédéric Chyzak, Pingchuan Ma +1

D-finite power series appear ubiquitously in combinatorics, number theory, and mathematical physics. They satisfy systems of linear partial differential equations whose solution sp…

cs.SC2019

On the Existence of Telescopers for Rational Functions in Three Variables

Shaoshi Chen, Lixin Du, Rong-Hua Wang +1

Zeilberger's method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers are linear differential or ($…