arXiv Analytics

Sign in

arXiv:1807.05893 [math.CO]AbstractReferencesReviewsResources

Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number

Stijn Cambie

Published 2018-07-16Version 1

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.

Comments: 14 pages, 9 figures
Categories: math.CO
Subjects: 05C12
Related articles: Most relevant | Search more
arXiv:1809.01901 [math.CO] (Published 2018-09-06)
Extremal graphs for vertex-degree-based invariants with given degree sequences
arXiv:1212.5008 [math.CO] (Published 2012-12-20)
On signless Laplacian coefficients of unicyclic graphs with given matching number
arXiv:1102.5409 [math.CO] (Published 2011-02-26)
The Wiener Index of Unicyclic Graphs with Girth and the Matching Number

Links

Toolbox