Extremal polygonal chains with respect to the Kirchhoff index
From MaRDI portal
(Redirected from Publication:6184328)
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 -connected outplane graph, and each interior face is a polygon with order at least 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.
Recommendations
Cites work
- Bounds for the Kirchhoff index via majorization techniques
- Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs
- Comparison theorems on resistance distances and Kirchhoff indices of S,T-isomers
- Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
- Computing lower bounds for the Kirchhoff index via majorization techniques
- Continuous forcing spectra of even polygonal chains
- Effective resistances and Kirchhoff index of ladder graphs
- Enumeration of the Gutman and Schultz indices in the random polygonal chains
- Enumeration of Wiener indices in random polygonal chains
- Extremal pentagonal chains with respect to the Kirchhoff index
- Extremal polygonal chains on k-matchings
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 6178130 (Why is no real title available?)
- scientific article; zbMATH DE number 7696638 (Why is no real title available?)
- Kirchhoff index, degree-Kirchhoff index and spanning trees of linear octagonal chains.
- Mathematical aspects of Wiener index
- Minimal hexagonal chains with respect to the Kirchhoff index
- On the Kirchhoff index and the number of spanning trees of linear phenylenes
- Resistance distance and the normalized Laplacian spectrum
- Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
- Spectral properties of some structurally related graphs
- The (degree-) Kirchhoff indices in random polygonal 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
- The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
- The expected values of Kirchhoff indices in the random polyphenyl and spiro chains
- The expected values of Wiener indices in random polycyclic chains
- The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
- The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
- Two-point resistances in the generalized phenylenes
- Uniqueness of electrical currents in a network of finite total resistance
- Wiener index of trees: Theory and applications
Cited in
(7)- Extremal Kirchhoff index in polycyclic chains
- Extremal polyphenyl chains with respect to the Kirchhoff index
- Resistance distances in stretched Cantor product networks
- Counting spanning trees with one perfect matching in helicene polygonal chains on the plane and cylinder
- Maximal polyomino chains with respect to the Kirchhoff index
- Wiener index of local rings
- Two kinds of polygonal chains with extremal Kemeny's constants
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)