Extremal polygonal chains with respect to the Kirchhoff index
Qi Ma
TL;DR
This paper characterizes extremal polygonal chains with respect to the Kirchhoff index, identifying those with minimum and maximum values, thereby extending previous results to more general cases.
Contribution
It provides a comprehensive characterization of polygonal chains that minimize or maximize the Kirchhoff index, generalizing earlier findings.
Findings
Polygonal chains with minimum Kirchhoff index identified
Even and odd polygonal chains with maximum Kirchhoff index characterized
Extends previous results to broader classes of graphs
Abstract
The Kirchhoff index is defined as the sum of resistance distances between all pairs of vertices in a graph. This index is a critical parameter for measuring graph structures. In this paper, we characterize polygonal chains with the minimum Kirchhoff index, and characterize even (odd) polygonal chains with the maximum Kirchhoff index, which extends the results of \cite{45}, \cite{14} and \cite{2,13,44} to a more general case.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Molecular Junctions and Nanostructures · Molecular Sensors and Ion Detection