Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
From MaRDI portal
Publication:6064850
DOI10.1016/J.DAM.2023.06.011zbMath1530.92331MaRDI QIDQ6064850
No author found.
Publication date: 11 December 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Enumeration in graph theory (05C30) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- The minimal number of subtrees with a given degree sequence
- Subtrees of spiro and polyphenyl hexagonal chains
- On the eccentric subtree number in trees
- Enumeration of subtrees of trees
- On subtrees of trees
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
- 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 subtree number index in random polyphenylene and spiro chains
- The number of subtrees in graphs with given number of cut edges
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- The expected values and variances for Sombor indices in a general random chain
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe 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 graphs
- The Expected Values of Merrifield-Simmons Index in Random Phenylene Chains
- The Number of Subtrees of Trees with Given Degree Sequence
- Trees with large numbers of subtrees
- Novel PI indices of hexagonal chains
This page was built for publication: Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
