default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingqing Zhai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Mingqing Zhai, Muhuo Liu
:
Extremal problems on planar graphs without k edge-disjoint cycles. Adv. Appl. Math. 157: 102701 (2024)- [j27]Longfei Fang, Mingqing Zhai, Huiqiu Lin:
Spectral Extremal Problem on $t$ Copies of $\ell$-Cycles. Electron. J. Comb. 31(4) (2024) - [j26]Xin Li, Mingqing Zhai, Jinlong Shu:
A Brualdi-Hoffman-Turán problem on cycles. Eur. J. Comb. 120: 103966 (2024) - 2023
- [j25]Bing Wang, Mingqing Zhai:
Maxima of the Q-index: Forbidden a fan. Discret. Math. 346(3): 113264 (2023) - [j24]Longfei Fang, Mingqing Zhai:
Outerplanar Turán numbers of cycles and paths. Discret. Math. 346(12): 113655 (2023) - [j23]Bo Ning, Mingqing Zhai:
Counting substructures and eigenvalues I: Triangles. Eur. J. Comb. 110: 103685 (2023) - [j22]Mingqing Zhai, Huiqiu Lin:
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs. J. Graph Theory 102(3): 502-520 (2023) - 2022
- [j21]Huiqiu Lin, Mingqing Zhai, Yanhua Zhao:
Spectral Radius, Edge-Disjoint Cycles and Cycles of the Same Length. Electron. J. Comb. 29(2) (2022) - [j20]Mingqing Zhai, Ruifang Liu, Jie Xue:
A Unique Characterization of Spectral Extrema for Friendship Graphs. Electron. J. Comb. 29(3) (2022) - [j19]Mingqing Zhai, Jinlong Shu:
A spectral version of Mantel's theorem. Discret. Math. 345(1): 112630 (2022) - [j18]Mingqing Zhai, Huiqiu Lin, Yanhua Zhao:
Maximize the Q-index of graphs with fixed order and size. Discret. Math. 345(1): 112669 (2022) - [j17]Longfei Fang, Bing Wang, Mingqing Zhai:
Planar Turán number of intersecting triangles. Discret. Math. 345(5): 112794 (2022) - [j16]Mingqing Zhai, Huiqiu Lin:
Spectral extrema of Ks, t-minor free graphs - On a conjecture of M. Tait. J. Comb. Theory B 157: 184-215 (2022) - 2021
- [j15]Longfei Fang, Mingqing Zhai, Bing Wang:
Complete subgraphs in connected graphs and its application to spectral moment. Discret. Appl. Math. 291: 36-42 (2021) - [j14]Mingqing Zhai, Huiqiu Lin, Jinlong Shu:
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs. Eur. J. Comb. 95: 103322 (2021) - [j13]Mingqing Zhai, Longfei Fang, Jinlong Shu:
On the Turán Number of Theta Graphs. Graphs Comb. 37(6): 2155-2165 (2021) - 2020
- [j12]Mingqing Zhai, Huiqiu Lin:
Spectral extrema of graphs: Forbidden hexagon. Discret. Math. 343(10): 112028 (2020)
2010 – 2019
- 2019
- [j11]Longfei Fang, Bing Wang, Mingqing Zhai:
On the spectral moment of quasi-bicyclic graphs. Appl. Math. Comput. 363 (2019) - 2018
- [j10]Guanglong Yu, Mingqing Zhai, Chao Yan, Shu-Guang Guo:
The least Q-eigenvalue with fixed domination number. Appl. Math. Comput. 339: 477-487 (2018) - 2017
- [j9]Guanglong Yu, Shu-Guang Guo, Mingqing Zhai:
Distance spectral radius of a tree with given diameter. Ars Comb. 134: 351-362 (2017) - 2012
- [j8]Mingqing Zhai, Guanglong Yu, Jinlong Shu:
Clique number and distance spectral radii of graphs. Ars Comb. 104: 385-392 (2012) - [j7]Yongsheng Ye, Mingqing Zhai, Yun Zhang:
Pebbling number of squares of odd cycles. Discret. Math. 312(21): 3174-3178 (2012) - 2011
- [j6]Mingqing Zhai, Jinlong Shu, Yuan Hong:
On the Laplacian spread of graphs. Appl. Math. Lett. 24(12): 2097-2101 (2011) - [j5]Mingqing Zhai, Ruifang Liu, Jinlong Shu:
On the (Laplacian) spectral radius of bipartite graphs with given number of blocks. Ars Comb. 98: 311-319 (2011) - 2010
- [j4]Mingqing Zhai, Guanglong Yu, Jinlong Shu:
The Laplacian spectral radius of bicyclic graphs with a given girth. Comput. Math. Appl. 59(1): 376-381 (2010) - [j3]Mingqing Zhai, Ruifang Liu, Jinlong Shu:
Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. Discret. Math. 310(4): 947-955 (2010)
2000 – 2009
- 2007
- [j2]Changhong Lu, Lei Chen, Mingqing Zhai:
Extremal problems on consecutive L(2, 1)-labelling. Discret. Appl. Math. 155(10): 1302-1313 (2007) - [j1]Changhong Lu, Mingqing Zhai:
An extremal problem on non-full colorable graphs. Discret. Appl. Math. 155(16): 2165-2173 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
