Extremal polygonal chains with respect to the Kirchhoff index

DOI10.1016/J.DAM.2023.09.022arXiv2210.10316MaRDI QIDQ6184328FDOQ6184328

Qi Ma

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: The sum of resistance distances between all pairs of the vertices is defined as the Kirchhoff index. It is a crucial parameter for measuring graph structures such as networks. A plane graph is said to be an outplane graph if all the vertices lie on the boundary of the exterior face. A polygonal chain is a $2$-connected outplane graph, and each interior face is a polygon with order at least $4$ and is adjacent with at most two such polygons. In this paper, we determine the polygonal chain with the minimum Kirchhoff index and characterize polygonal chains with the maximum Kirchhoff index. These results cover some previous results for special chains.

Full work available at URL: https://arxiv.org/abs/2210.10316

zbMATH Keywords

Kirchhoff indexpolygonal chain\( S, T\)-isomersresistance distanc

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds for the Kirchhoff index via majorization techniques
• Wiener index of trees: Theory and applications
• Resistance distance and the normalized Laplacian spectrum
• The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
• Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs
• Effective resistances and Kirchhoff index of ladder graphs
• The expected values of Kirchhoff indices in the random polyphenyl and spiro chains
• Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
• Spectral properties of some structurally related graphs
• Comparison theorems on resistance distances and Kirchhoff indices of \(S,T\)-isomers
• Uniqueness of electrical currents in a network of finite total resistance
• The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
• Mathematical aspects of Wiener index
• The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
• The (degree-) Kirchhoff indices in random polygonal chains
• Enumeration of Wiener indices in random polygonal chains
• Continuous forcing spectra of even polygonal chains
• Enumeration of the Gutman and Schultz indices in the random polygonal chains
• Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
• Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
• Extremal pentagonal chains with respect to the Kirchhoff index
• The expected values of Wiener indices in random polycyclic chains
• The expected values and variances for Sombor indices in a general random chain
• The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
• Two-point resistances in the generalized phenylenes
• Minimal hexagonal chains with respect to the Kirchhoff index

Cited In (2)

• Extremal polyphenyl chains with respect to the Kirchhoff index
• Resistance distances in stretched Cantor product networks

This page was built for publication: Extremal polygonal chains with respect to the Kirchhoff index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184328)