The Kirchhoff indices and the matching numbers of unicyclic graphs

Xuli Qi, Bo Zhou and Zhibin Du

Applied Mathematics and Computation, 2016, vol. 289, issue C, 464-480

Abstract: The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. 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.

Keywords: Kirchhoff index; Resistance distance; Matching number; Unicyclic graph (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316303010
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:289:y:2016:i:c:p:464-480

DOI: 10.1016/j.amc.2016.05.003

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().