Pith. sign in

REVIEW

The Kirchhoff indices and the matching numbers of unicyclic graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1304.7546 v1 pith:FMJF5API submitted 2013-04-29 math.CO

The Kirchhoff indices and the matching numbers of unicyclic graphs

Xuli Qi , Bo Zhou , Zhibin Du This is my paper
classification math.CO
keywords graphskirchhoffgraphindexmatchingnumberunicyclicvertices
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.