Hanyuan Deng

Affiliations:
  • Hunan Normal University, Department of Mathematics, Changsha, China


According to our database1, Hanyuan Deng authored at least 40 papers between 2004 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The <i>k</i>-Szeged index of graphs.
Discret. Math., 2022

Maximum first Zagreb index of orientations of unicyclic graphs with given matching number.
Appl. Math. Comput., 2022

2021
The hexagonal chains with the first three maximal Mostar indices.
Discret. Appl. Math., 2021

2020
Maximum Balaban index and sum-Balaban index of cacti.
Discret. Math. Algorithms Appl., 2020

F index of graphs based on four new operations related to the strong product.
AKCE Int. J. Graphs Comb., 2020

2019
Minimum Szeged index among unicyclic graphs with perfect matchings.
J. Comb. Optim., 2019

Harary index of bipartite graphs.
Electron. J. Graph Theory Appl., 2019

Some tight bounds for the harmonic index and the variation of the Randić index of graphs.
Discret. Math., 2019

Comparison between the non-self-centrality number and the total irregularity of graphs.
Appl. Math. Comput., 2019

2018
The inverse sum indeg index of graphs with some given parameters.
Discret. Math. Algorithms Appl., 2018

Extremal bipartite graphs of given connectivity with respect to matching energy.
Discret. Appl. Math., 2018

Extremal Properties of Some Topological Indices of Graphs.
Ars Comb., 2018

A Note on Harmonic Index and Coloring Number of a Graph.
Ars Comb., 2018

2017
Sufficient conditions for certain structural properties of graphs based on Wiener-type indices.
Contributions Discret. Math., 2017

Independent sets on the Towers of Hanoi graphs.
Ars Math. Contemp., 2017

A stronger relation between coloring number and the modification of Randic index.
Ars Comb., 2017

On R' index of a graph.
Ars Comb., 2017

On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs.
Ars Comb., 2017

On the monotonicity of topological indices and the connectivity of a graph.
Appl. Math. Comput., 2017

The Zagreb indices of graphs based on four new operations related to the lexicographic product.
Appl. Math. Comput., 2017

2016
The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain.
J. Comb. Optim., 2016

The expected values of Wiener indices in random polygonal chains.
Ars Comb., 2016

The Zagreb indices of four operations on graphs.
Appl. Math. Comput., 2016

The extremal values of some topological indices in bipartite graphs with a given matching number.
Appl. Math. Comput., 2016

2015
Multiplicatively weighted Harary index of graphs.
J. Comb. Optim., 2015

A unified linear-programming modeling of some topological indices.
J. Comb. Optim., 2015

The expected values of Kirchhoff indices in the random polyphenyl and spiro chains.
Ars Math. Contemp., 2015

2014
Double hexagonal chains with the extremal third order Randic index.
Ars Comb., 2014

2013
On the harmonic index and the chromatic number of a graph.
Discret. Appl. Math., 2013

Double hexagonal chains with the extremal PI indices.
Ars Comb., 2013

2012
Wiener indices of spiro and polyphenyl hexagonal chains.
Math. Comput. Model., 2012

A sharp lower bound of index of the cacti with perfect matchings.
Ars Comb., 2012

2011
On the sum-connectivity index of cacti.
Math. Comput. Model., 2011

A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenes.
Comput. Math. Appl., 2011

2010
The maximum Wiener polarity index of trees with k pendants.
Appl. Math. Lett., 2010

2009
The smallest Merrifield-Simmons index of (n, n+1)-graphs.
Math. Comput. Model., 2009

The hexagonal chains with the extremal third-order Randic index.
Appl. Math. Lett., 2009

2008
The largest Hosoya index of (n, n+1)-graphs.
Comput. Math. Appl., 2008

2006
Edge-reconstruction of the decay number of a connected graph.
Australas. J Comb., 2006

2004
On the construction of most reliable networks.
Discret. Appl. Math., 2004


  Loading...