default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuanglong Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Lin Sun
, Guanglong Yu, Jianliang Wu:
On list (p, 1)-total labellings of special planar graphs and 1-planar graphs. J. Comb. Optim. 47(3): 15 (2024)- 2023
- [j28]Lin Sun, Guanglong Yu, Xin Li:
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23. Discret. Appl. Math. 337: 257-271 (2023) - 2021
- [j27]Guanglong Yu, Lin Sun, Chao Yan, Yarong Wu, Hailiang Zhang:
Least Q-eigenvalues of nonbipartite 2-connected graphs. Discret. Appl. Math. 297: 71-79 (2021) - [j26]Lin Sun, Guanglong Yu, Xin Li:
Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24. Discret. Math. 344(1): 112190 (2021)
2010 – 2019
- 2019
- [j25]Hailiang Zhang, Guangting Chen, Guanglong Yu:
On the largest matching roots of graphs with a given number of pendent vertices. Discret. Appl. Math. 255: 339-344 (2019) - 2018
- [j24]Guanglong Yu, Mingqing Zhai, Chao Yan, Shu-Guang Guo:
The least Q-eigenvalue with fixed domination number. Appl. Math. Comput. 339: 477-487 (2018) - [j23]Rong Zhang, Shu-Guang Guo, Guanglong Yu:
Ordering connected non-bipartite graphs by the least Q-eigenvalue. Ars Comb. 141: 3-20 (2018) - [j22]Ryan Bergen, Shaun M. Fallat, Adam Gorr, Ferdinand Ihringer, Karen Meagher, Alison Purdy, Boting Yang, Guanglong Yu:
Infection in hypergraphs. Discret. Appl. Math. 237: 43-56 (2018) - 2017
- [j21]Guanglong Yu, Shu-Guang Guo, Mingqing Zhai:
Distance spectral radius of a tree with given diameter. Ars Comb. 134: 351-362 (2017) - [j20]Lihua You, Liyong Ren, Guanglong Yu:
Distance and distance signless Laplacian spread of connected graphs. Discret. Appl. Math. 223: 140-147 (2017) - 2016
- [j19]Guanglong Yu, Yarong Wu, Jinlong Shu:
Minimizing the least eigenvalue of bicyclic graphs with fixed diameter. Ars Comb. 124: 421-437 (2016) - [j18]Guanglong Yu, Chao Yan:
Bases of primitive nonpowerful zero-symmetric sign pattern matrices without nonzero diagonal entry. Ars Comb. 125: 409-432 (2016) - [j17]Guanglong Yu, Hailiang Zhang, Jinling Shu:
Some graft transformations and its applications on Q-spectral radius of a graph. Ars Comb. 126: 3-11 (2016) - [j16]Shu-Guang Guo, Guanglong Yu:
On the Q-index and index of triangle-free quasi-tree graphs. Ars Comb. 126: 369-382 (2016) - 2015
- [j15]Guanglong Yu, Zhengke Miao:
On the local base of a primitive and nonpowerful sign pattern. Discret. Math. 338(8): 1473-1480 (2015) - [j14]Hailiang Zhang, Guanglong Yu, Shanlin Li:
Graphs with six distinct matching roots. Inf. Process. Lett. 115(5): 521-526 (2015) - 2014
- [j13]Guanglong Yu, Shu-Guang Guo, Rong Zhang, Yarong Wu:
The domination number and the least Q-eigenvalue. Appl. Math. Comput. 244: 274-282 (2014) - [j12]Shu-Guang Guo, Meiling Xu, Guanglong Yu:
On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter. Ars Comb. 114: 385-395 (2014) - [j11]Guanglong Yu, Zhengke Miao, Chao Yan, Jinlong Shu:
The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3. Ars Comb. 115: 401-410 (2014) - [j10]Yarong Wu, Guanglong Yu, Jinlong Shu:
Graphs with small second largest Laplacian eigenvalue. Eur. J. Comb. 36: 190-197 (2014) - 2013
- [j9]Hailiang Zhang, Rongfei Lin, Guanglong Yu:
The largest matching root of unicyclic graphs. Inf. Process. Lett. 113(19-21): 804-806 (2013) - 2012
- [j8]Guanglong Yu, Huicai Jia, Hailiang Zhang, Jinlong Shu:
Some graft transformations and its applications on the distance spectral radius of a graph. Appl. Math. Lett. 25(3): 315-319 (2012) - [j7]Mingqing Zhai, Guanglong Yu, Jinlong Shu:
Clique number and distance spectral radii of graphs. Ars Comb. 104: 385-392 (2012) - [j6]Guanglong Yu, Hailiang Zhang, Huiqiu Lin, Yarong Wu, Jinlong Shu:
Distance spectral spread of a graph. Discret. Appl. Math. 160(16-17): 2474-2478 (2012) - [j5]Huiqiu Lin, Jinlong Shu, Yarong Wu, Guanglong Yu:
Spectral radius of strongly connected digraphs. Discret. Math. 312(24): 3663-3669 (2012) - [j4]Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of primitive nonpowerful sign patterns. Theor. Comput. Sci. 447: 136-143 (2012) - 2011
- [j3]Guanglong Yu, Zhengke Miao, Jinlong Shu:
The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries. Discret. Math. 311(6): 493-503 (2011) - [j2]Guanglong Yu, Yarong Wu, Yajie Zhang, Jinlong Shu:
Some graft transformations and its application on a distance spectrum. Discret. Math. 311(20): 2117-2123 (2011) - 2010
- [j1]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) - [c1]Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of Primitive Nonpowerful Sign Patterns. COCOA (1) 2010: 114-127
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-10-07 21:24 CEST 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:
