most citedAdjacency eigenvalues of graphs without short odd cycles

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

collaborators

1 paper

math.CO2021★ 3 cited

Adjacency eigenvalues of graphs without short odd cycles

Shuchao Li, Wanting Sun, Yuantian Yu

It is well known that spectral Turán type problem is one of the most classical {problems} in graph theory. In this paper, we consider the spectral Turán type problem. Let be a…