3 papers
math.CO2023
Some results on the Wiener index related to the Šoltés problem of graphs
Andrey A. Dobrynin, Konstantin V. Vorob'ev
The Wiener index, , of a connected graph is the sum of distances between its vertices. In 2021, Akhmejanova et al. posed the problem of finding graphs with large $R_m…
math.CO2021
On the Wiener (r,s)-complexity of fullerene graphs
Andrey A. Dobrynin, Andrei Yu. Vesnin
Fullerene graphs are mathematical models of fullerene molecules. The Wiener -complexity of a fullerene graph with vertex set is the number of pairwise distinct va…
math.CO2019
On the Wiener complexity and the Wiener index of fullerene graphs
Andrey A. Dobrynin, Andrei Yu. Vesnin
Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of…