3 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2022
Sharp bounds on the -index of graphs in terms of the independence number
Wanting Sun, Lixia Yan, Shuchao Li +1
Given a graph , the adjacency matrix and degree diagonal matrix of are denoted by and , respectively. In 2017, Nikiforov \cite{0007} proposed the -matrix:…
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…
math.CO2021
An arithmetic criterion for graphs being determined by their generalized -spectrum
Shuchao Li, Wanting Sun
Let be a graph on vertices, its adjacency matrix and degree diagonal matrix are denoted by and , respectively. In 2017, Nikiforov \cite{0007} introduced the ma…