default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuifu Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j21]Xiaodong Chen, Jiayuan Zhang, Liming Xiong, Guifu Su:
Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs. Discret. Appl. Math. 360: 51-64 (2025)- 2024
- [j20]Yuan Zhang, Haiying Wang, Guifu Su, Kinkar Chandra Das
:
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number. Discret. Appl. Math. 345: 190-206 (2024) - 2022
- [j19]Guifu Su, Guanbang Song, Junfeng Du, Weixing Yang, Gang Rao, Jun Yin:
A Complete Characterization of Bipartite Graphs with Given Diameter in Terms of the Inverse Sum Indeg Index. Axioms 11(12): 691 (2022) - [j18]Guifu Su, Guanbang Song, Jun Yin, Junfeng Du:
A Complete Characterization of Bidegreed Split Graphs with Four Distinct α-Eigenvalues. Symmetry 14(5): 899 (2022) - 2021
- [j17]Junjiang Li, Guifu Su, Guanbang Song:
New comments on "A Hamilton sufficient condition for completely independent spanning tree". Discret. Appl. Math. 305: 10-15 (2021) - 2020
- [j16]Guifu Su, Zihao Li, Huichao Shi:
Sufficient conditions for a graph to be k-edge-hamiltonian, k-path-coverable, traceable and Hamilton-connected. Australas. J Comb. 77: 269-284 (2020)
2010 – 2019
- 2018
- [j15]Litao Guo, Guifu Su, Wenshui Lin, Jinsong Chen:
Fault tolerance of locally twisted cubes. Appl. Math. Comput. 334: 401-406 (2018) - 2017
- [j14]Jianhua Tu, Yukang Zhou, Guifu Su:
A kind of conditional connectivity of Cayley graphs generated by wheel graphs. Appl. Math. Comput. 301: 177-186 (2017) - [j13]Zhibing Chen, Guifu Su, Lutz Volkmann:
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs. Discret. Appl. Math. 218: 64-70 (2017) - 2016
- [j12]Guifu Su:
A new version for Co-PI Iindex of a graph. Ars Comb. 127: 279-292 (2016) - [j11]Guifu Su, Liming Xiong, Xiaofeng Su, Guojun Li:
Maximally edge-connected graphs and Zeroth-order general Randić index for α ≤ -1. J. Comb. Optim. 31(1): 182-195 (2016) - 2015
- [j10]Guifu Su, Lan Xu:
Topological indices of the line graph of subdivision graphs and their Schur-bounds. Appl. Math. Comput. 253: 395-401 (2015) - [j9]Jianhua Tu, Junfeng Du, Guifu Su:
The unicyclic graphs with maximum degree resistance distance. Appl. Math. Comput. 268: 859-864 (2015) - [j8]Guifu Su, Jianhua Tu, Kinkar Chandra Das:
Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index. Appl. Math. Comput. 270: 705-710 (2015) - [j7]Junfeng Du, Guifu Su, Jianhua Tu, Ivan Gutman:
The degree resistance distance of cacti. Discret. Appl. Math. 188: 16-24 (2015) - [j6]Guifu Su, Liming Xiong, Xiaofeng Su, Xianglian Chen:
Some results on the reciprocal sum-degree distance of graphs. J. Comb. Optim. 30(3): 435-446 (2015) - 2014
- [j5]Guifu Su, Liming Xiong, Xiaofeng Su:
Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1. Discret. Appl. Math. 167: 261-268 (2014) - 2013
- [j4]Guifu Su, Liming Xiong, Lan Xu:
On the Co-PI and Laplacian Co-PI eigenvalues of a graph. Discret. Appl. Math. 161(1-2): 277-283 (2013) - [j3]Guifu Su, Liming Xiong, Brian Yi Sun, Daobin Li:
Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts. Theor. Comput. Sci. 471: 74-83 (2013) - 2012
- [j2]Guifu Su, Liming Xiong, Lan Xu:
The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs. Appl. Math. Lett. 25(11): 1701-1707 (2012) - 2011
- [j1]Zhihua An, Baoyindureng Wu, Daobin Li, Yun Wang, Guifu Su:
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts. Discret. Math. Algorithms Appl. 3(3): 305-310 (2011)
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-04 20:59 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:
