论文标题
相对于Kirchhoff指数的极端多边形链
Extremal polygonal chains with respect to the Kirchhoff index
论文作者
论文摘要
Kirchhoff指数定义为图中所有顶点之间的电阻距离之和。该指数是测量图结构的关键参数。在本文中，我们表征了具有最小Kirchhoff指数的多边形链，并以最大Kirchhoff索引表征了（奇数）多边形链，该链扩展了\ cite {45}，\ cite {14}的结果，\ cite {14}和\ cite {2,13,44}到更普遍的情况。
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.
