Ya-Hong Chen, Xiao-Dong Zhang
Published 2011-02-26Version 1
In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order $n$ with girth and the matching number $\beta\ge \frac{3g}{2}$. Moreover, we characterize all extremal graphs which attain the lower bound.
Extremal graphs for vertex-degree-based invariants with given degree sequences
On signless Laplacian coefficients of unicyclic graphs with given matching number
Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number
![QR code for arXiv:1102.5409 [math.CO]](http://oss.arxitics.com/images/favicon.svg)