21 citations · 49 across the 16 of their papers we have counts for
16 papers
Signless Laplacian spectral radius of graphs without short cycles or long cycles
Wenwen Chen, Bing Wang, Mingqing Zhai
The signless Laplacian spectral radius of a graph , denoted by , is the largest eigenvalue of its signless Laplacian matrix. In this paper, we investigate extremal signles…
Spectral extremal problem on copies of -cycle
Longfei Fang, Mingqing Zhai, Huiqiu Lin
Denote by the disjoint union of cycles of length . Let and be the maximum size and spectral radius over all -vertex -free graphs, re…
A spectral Erdős-Pósa Theorem
Zhai Mingqing, Liu Ruifang
A set of cycles is called independent if no two of them have a common vertex. Let be the complete split graph, which is the join of a clique of size with an in…
Counting substructures and eigenvalues II: quadrilaterals
Bo Ning, Mingqing Zhai
Let be a graph and be the spectral radius of . A previous result due to Nikiforov [Linear Algebra Appl., 2009] in spectral graph theory asserted that every graph …
Counting substructures and eigenvalues I: triangles
Bo Ning, Mingqing Zhai
Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start u…
Outerplanar Turán numbers of cycles and paths
Longfei Fang, Mingqing Zhai
A graph is outerplanar if it can be embedded in a plane such that all vertices lie on its outer face. The outerplanar Turán number of a given graph , denoted by ${\rm ex}_{\math…
Spectral radius, edge-disjoint cycles and cycles of the same length
Huiqiu Lin, Mingqing Zhai, Yanhua Zhao
In this paper, we give spectral conditions to guarantee the existence of two edge disjoint cycles and two cycles of the same length. These two results can be seen as spectral analo…
Spectral extrema of -minor free graphs--On a conjecture of M. Tait
Mingqing Zhai, Huiqiu Lin
Minors play an important role in extremal graph theory and spectral extremal graph theory. Tait [The Colin de Verdière parameter, excluded minors, and the spectral radius, J. Combi…
Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
Mingqing Zhai, Huiqiu Lin, Jinlong Shu
Nikiforov [Some inequalities for the largest eigenvalue of a graph, Combin. Probab. Comput. 179--189] showed that if is -free then the spectral radius $ρ(G)\leq\sqrt{2…
A strengthening of the spectral chromatic critical edge theorem: books and theta graphs
Mingqing Zhai, Huiqiu Lin
The chromatic critical edge theorem of Simonovits states that for a given color critical graph with , there exists an such that the Turán graph is…
Planar Turán Number of intersecting triangles
Longfei Fang, Mingqing Zhai, Bing Wang
The planar Turán number of a given graph , denoted by , is the maximum number of edges over all planar graphs on vertices that do not contain a copy o…
A spectral extremal problem on graphs with given size and matching number
Mingqing Zhai, Jie Xue, Ruifang Liu
Brualdi and Hoffman (1985) proposed the problem of determining the maximal spectral radius of graphs with given size. In this paper, we consider the Brualdi-Hoffman type problem of…
The maximum number of s-cliques in connected graphs and its application to spectral moment
Longfei Fang, Mingqing Zhai, Bing Wang
Extremal problems concerning the number of complete subgraphs have a long story in extremal graph theory. Let be the number of -cliques in a graph and $m={{r_m}\cho…
Further results on the least Q-eigenvalue of a graph with fixed domination number
Guanglong Yu, Yarong Wu, Mingqing Zhai
In this paper, we proceed on determining the minimum among the connected nonbipartite graphs on vertices and with domination number $\frac{n+1}{3}<γ\leq \frac{n…
Distance spectral radius of a tree with given diameter
Guanglong Yu, Shuguang Guo, Mingqing Zhai
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the tree…
Spectral conditions for the existence of specified paths and cycles in graphs
Mingqing Zhai, Huiqiu Lin, Shicai Gong
Let be a graph with vertices and be the least eigenvalue of its adjacency matrix of . In this paper, we give sharp bounds on the least eigenvalue of graphs with…