The expected subtree number index in random polyphenylene and spiro chains

DOI10.1016/J.DAM.2020.06.013zbMATH Open1447.05059arXiv2007.05959OpenAlexW3038718769MaRDI QIDQ2197461FDOQ2197461

Authors: Yu Yang, J. Cao, Hua Wang, Xiaojun Sun, Xiao-Dong Zhang 

Publication date: 31 August 2020

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

Abstract: Subtree number index $emphSTN(G)$ of a graph $G$ is the number of nonempty subtrees of $G$. It is a structural and counting based topological index that has received more and more attention in recent years. In this paper we first obtain exact formulas for the expected values of subtree number index of random polyphenylene and spiro chains, which are molecular graphs of a class of unbranched multispiro molecules and polycyclic aromatic hydrocarbons. Moreover, we establish a relation between the expected values of the subtree number indices of a random polyphenylene and its corresponding hexagonal squeeze. We also present the average values for subtree number indices with respect to the set of all polyphenylene and spiro chains with $n$ hexagons.

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

Recommendations

• Subtrees of spiro and polyphenyl hexagonal 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 Merrifield-Simmons index in random phenylene chains
• The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain
• The expected values of Hosoya index and Merrifield-Simmons index in a random spiro chain

zbMATH Keywords

expected valueaverage valuerandom polyphenylene chainrandom spiro chainsubtree number index

Mathematics Subject Classification ID

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

Cites Work

• On subtrees of trees
• Extremal values of ratios: distance problems vs. subtree problems in trees. II
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Subtrees of spiro and polyphenyl hexagonal chains
• Enumeration of subtrees of trees
• Wiener index in random polyphenyl chains
• The minimal number of subtrees with a given degree sequence
• The Number of Subtrees of Trees with Given Degree Sequence
• Binary trees with the largest number of subtrees
• Wiener indices of spiro and polyphenyl hexagonal chains
• The expected values of Hosoya index and Merrifield-Simmons index in a random polyphenylene chain
• Six-membered ring spiro chains with extremal Merrifield-Simmons index and Hosoya index
• Chain hexagonal cacti: matchings and independent sets
• On the average number of nodes in a subtree of a tree
• Extremal results on average subtree density of series-reduced trees
• The average order of a subtree of a tree
• Correlation of Graph‐Theoretical Indices
• The Hosoya polynomial decomposition for polyphenyl chains
• The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
• On the Number of Nonisomorphic Subtrees of a Tree
• Subtrees of graphs
• Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains
• Trees with large numbers of subtrees
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees

Cited In (10)

• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• The (degree-) Kirchhoff indices in random polygonal chains
• The expected values of Wiener indices in random polycyclic chains
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• On subtree number index of generalized book graphs, fan graphs, and wheel graphs
• Topological aspects of certain covalent organic frameworks and metal organic frameworks
• Enumeration of subtrees of planar two-tree networks
• The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
• The statistical analysis for Sombor indices in a random polygonal chain networks

This page was built for publication: The expected subtree number index in random polyphenylene and spiro chains

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