Zejun Huang

most citedTurán problems for digraphs avoiding distinct walks of a given length with the same endpoints

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

Connected graphs with a given dissociation number attaining the minimum spectral radius

Zejun Huang, Jiahui Liu, Xinwei Zhang

A dissociation set of a graph is a set of vertices which induces a subgraph with maximum degree less than or equal to one. The dissociation number of a graph is the maximum cardina…

math.FA2023

Linear maps preserving (p,k) norms of tensor products of matrices

Zejun Huang, Nung-Sing Sze, Run Zheng

Let $m, n \geq 2$ be integers. Denote by $M_{n}$ the set of $n \times n$ complex matrices. Let $∥ \cdot ∥_{(p, k)}$ be the $(p, k)$ norm on $M_{mn}$ with $1 \leq k \leq mn$ and $2 < p < \infty$ .…

math.CO2016★ 1 cited

Turán problems for digraphs avoiding distinct walks of a given length with the same endpoints

Zejun Huang, Zhenhua Lyu, Pu Qiao

Let $n \geq 5$ and $k \geq 4$ be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also charact…