Chao Yan

most citedThe Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2019

Least $Q$ -eigenvalues of nonbipartite 2-connected graphs

Guanglong Yu, by Lin Sun, Chao Yan +2

Among all simple nonbipartite 2-connected graphs and among all nonbipartite $θ$ -graphs, the minimum least $Q$ -eigenvalues are completely determined, respectively.

math.CO2019

On the spectral radii of the unicyclic hypergraphs with fixed matching number

Guanglong Yu, Chao Yan, Yarong Wu +1

We determine the unique hypergraphs with maximum spectral radius among all connected $k$ -uniform ( $k \geq 3$ ) unicyclic hypergraphs with matching number at least $z$ , and among all…

Least Q-eigenvalues of nonbipartite 2-connected graphs

On the spectral radii of the unicyclic hypergraphs with fixed matching number

Least $Q$ -eigenvalues of nonbipartite 2-connected graphs