Author

Cun-Xiang Duan

3 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.

Sep 2026

The Characteristic Polynomials of Uniform Double Starlike Hypertrees and Uniform Squids

A [Formula: see text]-power hypergraph is obtained from a graph by adding [Formula: see text] new vertices to each edge of the graph. Let [Formula: see text] be a graph obtained by adding [Formula: see text] edges and [Formula: see text] edges to the two pendant vertices of a path of length 2, respectively. A [Formula:...

Su-Wan Huang, Cun-Xiang Duan, Qian Zhao · Journal of Interconnection N... · 0 citations

Open access Sep 2026

Bounds on the Spectral Radii of Berge $C_5$-Free Linear $r$-Graphs

An $r$-uniform hypergraph (or $r$-graph) is called linear if any two edges intersect in at most one vertex. For a graph $F=\bigl(V(F),E(F)\bigr)$ and a hypergraph $\mathcal{B}=\bigl(V(\mathcal{B}),E(\mathcal{B})\bigr)$, $\mathcal{B}$ is called a Berge $F$ if there exists a bijection $\phi:E(F)\to E(\mathcal{B})$ such t...

Bo Dong, Cun-Xiang Duan, Li-Gong Wang · Electronic Journal of Combin... · 0 citations

Preprint Sep 2026

Spectral Extremal Graphs without a $K_k$-Factor

Let $k\ge 3$ and let $n=km$. A $K_k$-factor in an $n$-vertex graph is a collection of $m$ vertex-disjoint copies of $K_k$ that covers the entire vertex set. We determine the maximum adjacency spectral radius of an $n$-vertex graph containing no $K_k$-factor when $m\ge 2k-1$. More precisely, we prove that every such gra...

Cun-Xiang Duan, Ting-Ting Han, Lin-Peng Zhang · 0 citations