The expected subtree number index in random polyphenylene and spiro chains
Yu Yang, Xiao-Jun Sun, Jia-Yi Cao, Hua Wang, Xiao-Dong Zhang

TL;DR
This paper derives exact formulas for the expected subtree number index in random polyphenylene and spiro chains, providing insights into their structural properties and relationships with related molecular graphs.
Contribution
It introduces new exact formulas for expected subtree number indices in specific molecular graph classes and explores their relationships with hexagonal squeeze graphs.
Findings
Exact formulas for expected subtree number indices in random polyphenylene and spiro chains.
A relation between subtree indices of a chain and its hexagonal squeeze.
Average subtree number indices for all chains with n hexagons.
Abstract
Subtree number index of a graph is the number of nonempty subtrees of . 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 hexagons.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Computational Drug Discovery Methods
