arXiv Analytics

Sign in

arXiv:1304.7546 [math.CO]AbstractReferencesReviewsResources

The Kirchhoff indices and the matching numbers of unicyclic graphs

Xuli Qi, Bo Zhou, Zhibin Du

Published 2013-04-29Version 1

The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. It found considerable applications in a variety of fields. In this paper, we determine the minimum Kirchhoff index among the unicyclic graphs with fixed number of vertices and matching number, and characterize the extremal graphs.

Categories: math.CO
Subjects: 05C90, 05C12, 05C35
Related articles: Most relevant | Search more
arXiv:1107.2171 [math.CO] (Published 2011-07-12)
Reverse degree distance of unicyclic graphs
arXiv:math/0611842 [math.CO] (Published 2006-11-27)
Graphs with restricted valency and matching number
arXiv:1807.05893 [math.CO] (Published 2018-07-16)
Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number

Links

Toolbox