The Wiener Index of Unicyclic Graphs with Girth and the Matching Number

preprint2011arXivOpen access

Abstract

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 nn with girth and the matching number β≥3g2β\ge \frac{3g}{2}. Moreover, we characterize all extremal graphs which attain the lower bound.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.