Cunxiang Duan

activity

20182025

collaborators

3 papers

math.CO2025

The characteristic polynomials of $r$ -uniform hypercycles with length $l$

Dong Bo, Duan Cunxiang, Wang Ligong

Let $C_{l}$ be a cycle with length $l .$ The $r$ -uniform hypercycle with length $l$ is obtained by adding $r - 2$ new vertices in every edge of $C_{l},$ denoted by $C_{l}^{(r)}$ . In thi…

math.CO2020

The bounds of the spectral radius of general hypergraphs in terms of clique number

Cunxiang Duan, Ligong Wang

The spectral radius (or the signless Laplacian spectral radius) of a general hypergraph is the maximum modulus of the eigenvalues of its adjacency (or its signless Laplacian) tenso…

math.CO2018

The largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)

Cunxiang Duan, Ligong Wang, Peng Xiao

Let $S_{1} (m, d, k)$ be the $k$ -uniform supertree obtained from a loose path $P : v_{1}, e_{1}, v_{2}, \dots, v_{d}, e_{d}, v_{d + 1}$ with length $d$ by attaching $m - d$ edges at verte…

The characteristic polynomials of r-uniform hypercycles with length l

The bounds of the spectral radius of general hypergraphs in terms of clique number

The largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)

The characteristic polynomials of $r$ -uniform hypercycles with length $l$