Maximum Wiener index of unicyclic graphs with given bipartition
Combinatorics
2020-12-22 v3
Abstract
The \emph{Wiener index} is a widely studied topological index of graphs. One of the main problems in the area is to determine which graphs of given properties attain the extremal values of Wiener index. In this paper we resolve an open problem posed by Du in 2012. To this end we determine the unicyclic bipartite graphs with given size of parts having the maximum Wiener index. This completes the previous research in which the minimum case was solved.
Cite
@article{arxiv.1902.10661,
title = {Maximum Wiener index of unicyclic graphs with given bipartition},
author = {Jan Bok and Nikola Jedličková and Jana Maxová},
journal= {arXiv preprint arXiv:1902.10661},
year = {2020}
}
Comments
overall improvements