Fengwei Li

Appl. Math. Comput., 2026

2024

On Entropy Measures of Some Titania and Carbon Nanotubes.

[BibT_eX]

[DOI]

Parallel Process. Lett., March, 2024

The greatest values for atom-bond sum-connectivity index of graphs with given parameters.

[BibT_eX]

[DOI]

Huajing Lu

Discret. Appl. Math., February, 2024

Extremal graphs with given parameters in respect of general ABS index.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2023

The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles.

[BibT_eX]

[DOI]

Huajing Lu

Axioms, February, 2023

Polynomial algorithms for computing the isolated toughness of interval and split graphs.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2023

2022

ISI-Equienergetic Graphs.

[BibT_eX]

[DOI]

Axioms, 2022

Some New Bounds for the Inverse Sum Indeg Energy of Graphs.

[BibT_eX]

[DOI]

Hajo Broersma

Axioms, 2022

2021

Extremality of VDB topological indices over f-benzenoids with given order.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2021

2020

Note for Constructing Minimum Integrity Trees with Given Order and Maximum Degree<sup>*</sup>.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2020

Optimal Algorithm of Isolated Toughness for Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

2019

Convergence and correctness of belief propagation for the Chinese postman problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2019

A polynomial algorithm for weighted scattering number in interval graphs.

[BibT_eX]

[DOI]

Xiaoyan Zhang

Hajo Broersma

Discret. Appl. Math., 2019

Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time.

[BibT_eX]

[DOI]

Complex., 2019

2018

On two generalized connectivities of graphs.

[BibT_eX]

[DOI]

Zemin Jin

Yuefang Sun

Discuss. Math. Graph Theory, 2018

Extremal benzenoid systems for two modified versions of the Randić index.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

On total rainbow k-connected graphs.

[BibT_eX]

[DOI]

Yuefang Sun

Zemin Jin

Appl. Math. Comput., 2017

On edge-rupture degree of graphs.

[BibT_eX]

[DOI]

Yuefang Sun

Appl. Math. Comput., 2017

2016

The general connectivity indices of fluoranthene-type benzenoid systems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2016

2015

Second order Randić index of fluoranthene-type benzenoid systems.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2015

2009

On Integrity of Harary Graphs.

[BibT_eX]

[DOI]

Baohuai Sheng

Proceedings of the Combinatorial Optimization and Applications, 2009

2007

The neighbour-scattering number can be computed in polynomial time for interval graphs.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2007

The Size of a Minimum Critically <i>m</i> -Neighbor-Scattered Graph.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

The neighbor-scattering number can be computed in polynomial time for interval graphs

[BibT_eX]

[DOI]

CoRR, 2006

2005

Computational complexity and bounds for neighbor-scattering number of graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

2004

Computing the Rupture Degrees of Graphs.

[BibT_eX]

[DOI]