Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number

Abstract

In this article, we determine the maximum Wiener indices of unicyclic graphs with given number of vertices and matching number. We also characterize the extremal graphs. This solves an open problem of Du and Zhou.

14 pages, 9 figures

Cited by in corpus (1)

• Five results on maximizing topological indices in graphs