Subtrees of spiro and polyphenyl hexagonal chains
From MaRDI portal
Publication:668150
DOI10.1016/j.amc.2015.06.094zbMath1410.92178OpenAlexW870582675MaRDI QIDQ668150
Hua Wang, Yu Yang, Hongsun Fu, Hong Bo Liu
Publication date: 18 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.094
Trees (05C05) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (14)
Topological aspects of certain covalent organic frameworks and metal organic frameworks ⋮ On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees ⋮ Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains ⋮ The comparative analysis of two molecular indices in random polyphenyl and spiro chains ⋮ Distance-based topological indices of the tree-like polyphenyl systems ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ Some extremal graphs with respect to permanental sum ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ On subtree number index of generalized book graphs, fan graphs, and wheel graphs ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On topological indices of certain interconnection networks
- Computation of topological indices of certain networks
- Extremal values of vertex-degree-based topological indices over hexagonal systems with fixed number of vertices
- Greedy trees, subtrees and antichains
- Extremal results on average subtree density of series-reduced trees
- Resistance distances and the Kirchhoff index in Cayley graphs
- The minimal number of subtrees with a given degree sequence
- Terminal Wiener index
- Enumeration of subtrees of trees
- Binary trees with the largest number of subtrees
- Discrimination power of graph measures based on complex zeros of the partial Hosoya polynomial
- On topological indices of fullerenes
- Extremal trees with given degree sequence for the Randić index
- The extremal values of the Wiener index of a tree with given degree sequence
- The average order of a subtree of a tree
- The inverse problem for certain tree parameters
- Chain hexagonal cacti: matchings and independent sets
- On some counting polynomials in chemistry
- On subtrees of trees
- On the average number of nodes in a subtree of a tree
- Wiener indices of spiro and polyphenyl hexagonal chains
- Wiener index versus Szeged index in networks
- Further analysis on the total number of subtrees of trees
- Augmented Zagreb index
- Enumeration of BC-subtrees of trees
- A method of computing the PI index of benzenoid hydrocarbons using orthogonal cuts
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- The Kirchhoff index of subdivisions of graphs
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Distance in graphs
- The Number of Subtrees of Trees with Given Degree Sequence
- Correlation of Graph‐Theoretical Indices
- Wiener index of trees: Theory and applications
This page was built for publication: Subtrees of spiro and polyphenyl hexagonal chains
