3 citations · 4 across the 5 of their papers we have counts for
6 papers
A survey of edge-spectral-Turán type problems in spectral graph theory: Results, conjectures and open problems
Yuantian Yu, Huihui Zhang, Minjie Zhang
The edge-spectral-Turán type problem is also called the Brualdi-Hoffman-Turán type problem, which is a central topic in spectral graph theory, seeking to determine the maximum spec…
Spectral Turán-type problem in non--partite graphs: Forbidden generalized book graph
Yuantian Yu, Shuchao Li
Given a graph , a graph is said to be -free if it does not contain as a subgraph. A graph is color-critical when it has an edge whose removal leads to a reduction in its…
The exact Turán number of generalized book graph in non--partite graphs
Yuantian Yu, Shuchao Li
Given a graph we say that a graph is \textit{-free} if it does not contain as a subgraph. The Turán number $\ex(n,H)$ of is the maximum number of edges in an -ve…
The Hoffman program for mixed graphs
Yuantian Yu, Edwin R. van Dam
We consider Hoffman's program about the limit points of the spectral radius of the Hermitian adjacency matrix of mixed graphs. In particular, we determine all mixed graphs without…
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…
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…