The expected subtree number index in random polyphenylene and spiro chains

DOI10.1016/J.DAM.2020.06.013MaRDI QIDQ2197461zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

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

Cited in

(12)

• 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
• Subtrees of spiro and polyphenyl hexagonal chains
• 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
• On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees

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)