arXiv Analytics

Sign in

arXiv:2209.10264 [math.CO]AbstractReferencesReviewsResources

Extremal octagonal chains with respect to the Kirchhoff index

Qi Ma

Published 2022-09-21Version 1

Let $G$ be a connected graph. The resistance distance between any two vertices of $G$ is equal to the effective resistance between them in the corresponding electrical network constructed from $G$ by replacing each edge with a unit resistor. The Kirchhoff index is defined as the sum of resistance distances between all pairs of the vertices. These indices have been computed for many interesting graphs, such as linear polyomino chain, linear/M\"{o}bius/cylinder hexagonal chain, and linear/M\"{o}bius/cylinder octagonal chain. In this paper, we characterized the maximum and minimum octagonal chains with respect to the Kirchhoff index.

Comments: 11 pages, 8 figures. arXiv admin note: substantial text overlap with arXiv:2208.07727
Categories: math.CO
Subjects: 05C09, 05C92, 05C12
Related articles: Most relevant | Search more
arXiv:1901.00053 [math.CO] (Published 2018-12-31)
Spanning 2-Forests and Resistance Distance in 2-Connected Graphs
arXiv:1901.07547 [math.CO] (Published 2019-01-22)
Results on resistance distance and Kirchhoff index of graphs with generalized pockets
arXiv:2201.10858 [math.CO] (Published 2022-01-26)
On Kirchhoff index and number of spanning trees of linear pentagonal cylinder and Mobius chain graph