Guifu Su
According to our database1,
Guifu Su
authored at least 21 papers
between 2011 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs.
Discret. Appl. Math., 2025
2024
Extremal problems on the Atom-bond sum-connectivity indices of trees with given matching number or domination number.
Discret. Appl. Math., March, 2024
2022
A Complete Characterization of Bidegreed Split Graphs with Four Distinct α-Eigenvalues.
Symmetry, 2022
A Complete Characterization of Bipartite Graphs with Given Diameter in Terms of the Inverse Sum Indeg Index.
Axioms, 2022
2021
New comments on "A Hamilton sufficient condition for completely independent spanning tree".
Discret. Appl. Math., 2021
2020
Sufficient conditions for a graph to be <i>k</i>-edge-hamiltonian, <i>k</i>-path-coverable, traceable and Hamilton-connected.
Australas. J Comb., 2020
2018
2017
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs.
Discret. Appl. Math., 2017
Appl. Math. Comput., 2017
2016
J. Comb. Optim., 2016
A new version for Co-PI Iindex of a graph.
Ars Comb., 2016
2015
Appl. Math. Comput., 2015
Appl. Math. Comput., 2015
Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index.
Appl. Math. Comput., 2015
2014
Discret. Appl. Math., 2014
2013
Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts.
Theor. Comput. Sci., 2013
2012
Appl. Math. Lett., 2012
2011
Nordhaus-Gaddum-Type Theorem for Diameter of Graphs when Decomposing into Many Parts.
Discret. Math. Algorithms Appl., 2011