Tree-like polyphenyl systems with extremal Wiener indices
From MaRDI portal
Publication:3649827
zbMATH Open1199.05081MaRDI QIDQ3649827FDOQ3649827
Authors: Hong Bian, Fuji Zhang 
Publication date: 4 December 2009
Recommendations
Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cited In (18)
- Complete Forcing Numbers of Polyphenyl Systems
- Enumerating tree-like polyphenyl isomers
- Spanning trees and recurrent configurations of a graph
- Computing the Mostar index in networks with applications to molecular graphs
- Subtrees of spiro and polyphenyl hexagonal chains
- The polyphenyl chains with extremal edge-Wiener indices
- Polyphenyl chains with extremal Wiener index
- The Wiener index of \(r\)-uniform hypergraphs
- On computing some degree based topological indices for backbone DNA networks
- Hyper-Wiener indices of polyphenyl chains and polyphenyl spiders
- Comparison of the Wiener and Kirchhoff indices of random pentachains
- Enumeration of Wiener indices in random polygonal chains
- Hosoya and Merrifield-Simmons indices in random polyphenyl chains
- On structural properties of ABC-minimal chemical trees
- The comparative analysis of two molecular indices in random polyphenyl and spiro chains
- Hosoya and Merrifleld-Simmons indices in random polyphenyl chains
- Explicit relation between the Wiener index and the edge-Wiener index of the catacondensed hexagonal systems
- Distance-based topological indices of the tree-like polyphenyl systems
This page was built for publication: Tree-like polyphenyl systems with extremal Wiener indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3649827)
