18 citations · 68 across the 27 of their papers we have counts for
27 papers
Matching extension and matching exclusion via the size or the spectral radius of graphs
Shujing Miao, Shuchao Li, Wei Wei
A graph is said to be -extendable if every matching of size in can be extended to a perfect matching of , where is a positive integer. We say is -exclu…
Extensions on spectral extrema of -free graphs with given size
Shuchao Li, Wanting Sun, Wei Wei
Let denote a set of graphs. A graph is said to be -free if it does not contain any element of as a subgraph. The Turán number is the ma…
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:…
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…
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…
Hermitian adjacency matrix of the second kind for mixed graphs
Shuchao Li, Yuantian Yu
This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind { (-matrix for short)} introduced by Mohar \cite{0001…