default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShu-Guang Guo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Aiyun Ye, Shu-Guang Guo, Rong Zhang:
Some extremal problems on Aα-spectral radius of graphs with given size. Discret. Appl. Math. 342: 286-294 (2024)- [j20]Rong Zhang, Shu-Guang Guo:
Maxima of the Aα-index of graphs with given size and domination number. Discret. Appl. Math. 348: 35-45 (2024) - 2023
- [j19]Shu-Guang Guo, Rong Zhang:
Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size. Discret. Appl. Math. 341: 204-211 (2023) - [j18]Shu-Guang Guo, Rong Zhang:
Maxima of the Q-Spectral Radius of C3 (C4)-Free Graphs with Given Size and Minimum Degree $\delta \ge 2$. Graphs Comb. 39(5): 102 (2023) - 2022
- [j17]Shu-Guang Guo, Rong Zhang:
Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size. Discret. Appl. Math. 320: 408-415 (2022) - [j16]Fenglei Tian
, Shu-Guang Guo, Dein Wong:
On the multiplicity of the least signless Laplacian eigenvalue of a graph. Discret. Math. 345(9): 112940 (2022) - [j15]Shu-Guang Guo, Rong Zhang:
The Sharp Upper Bounds on the Aα -Spectral Radius of C4-Free Graphs and Halin Graphs. Graphs Comb. 38(1): 19 (2022)
2010 – 2019
- 2018
- [j14]Guanglong Yu, Mingqing Zhai, Chao Yan, Shu-Guang Guo:
The least Q-eigenvalue with fixed domination number. Appl. Math. Comput. 339: 477-487 (2018) - [j13]Rong Zhang, Shu-Guang Guo, Guanglong Yu:
Ordering connected non-bipartite graphs by the least Q-eigenvalue. Ars Comb. 141: 3-20 (2018) - 2017
- [j12]Guanglong Yu, Shu-Guang Guo, Mingqing Zhai:
Distance spectral radius of a tree with given diameter. Ars Comb. 134: 351-362 (2017) - 2016
- [j11]Shu-Guang Guo, Guanglong Yu:
On the Q-index and index of triangle-free quasi-tree graphs. Ars Comb. 126: 369-382 (2016) - 2014
- [j10]Guanglong Yu, Shu-Guang Guo, Rong Zhang, Yarong Wu:
The domination number and the least Q-eigenvalue. Appl. Math. Comput. 244: 274-282 (2014) - [j9]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) - [j8]Haibo Jiang, Liping Zhang, Shu-Guang Guo:
Cluster anti-consensus in directed networks of multi-agents based on the Q-theory. J. Frankl. Inst. 351(10): 4802-4816 (2014) - 2013
- [j7]Shu-Guang Guo:
On the Spectral Radius of Cactuses with n Vertices and Edge Independence Number q. Ars Comb. 110: 265-274 (2013) - 2012
- [j6]Shu-Guang Guo:
On the Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter. Ars Comb. 106: 47-58 (2012) - 2010
- [j5]Shu-Guang Guo:
The Sharp Lower Bound of the Least Eigenvalue of a Bicyclic Graph. Ars Comb. 95 (2010)
2000 – 2009
- 2009
- [j4]Shu-Guang Guo:
Restricted sumsets in a finite abelian group. Discret. Math. 309(23-24): 6530-6534 (2009) - 2008
- [j3]Shu-Guang Guo:
Ordering trees with n vertices and matching number q by their largest Laplacian eigenvalues. Discret. Math. 308(20): 4608-4615 (2008) - 2007
- [j2]Shu-Guang Guo:
On the Spectral Radius of Unicyclic Graphs with n Vertices and Edge Independence Number q. Ars Comb. 83 (2007) - 2005
- [j1]Shu-Guang Guo:
A conjecture on subset sums of a finite set of positive integers. Australas. J Comb. 31: 161-166 (2005)
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-05-23 22:10 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:
