Extremal polyphenyl chains with respect to the Kirchhoff index (Q6652423)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extremal polyphenyl chains with respect to the Kirchhoff index |
scientific article; zbMATH DE number 7957574
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extremal polyphenyl chains with respect to the Kirchhoff index |
scientific article; zbMATH DE number 7957574 |
Statements
Extremal polyphenyl chains with respect to the Kirchhoff index (English)
0 references
12 December 2024
0 references
The Kirchhoff index of a graph is the sum of the resistance distance between all vertex pairs in the graph \(G\). A graph with \(n\) hexagons where each hexagon is reduced to a vertex and can connect to a path is called a polyphenyl chain. The authors in this paper characterize the polyphenyl chains with maximal and minimal Kirchhoff index.
0 references
Kirchhoff index
0 references
polyphenyl chains
0 references
isomers
0 references
