Multi-distance granularity structural -subtree index of generalized Bethe trees

DOI10.1016/J.AMC.2019.04.037MaRDI QIDQ2279409zbMATH OpenOpenAlexFDO

Authors Yu Yang, Ai-wan Fan, Hua Wang, Hailian Lv, Xiao-Dong Zhang

Publication date 12 December 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.04.037

zbMATH Keywords

generating functiongeneralized Bethe treeBethe treedendrimer\( \alpha \)-subtree\( \alpha \)-subtree density

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Extremal problems in graph theory (05C35)

Recommendations

• Subtrees, BC-subtrees of generalized Bethe trees and related questions.
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• Enumeration of BC-subtrees of trees

Cites work

• scientific article; zbMATH DE number 614357 (Why is no real title available?)
• An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
• Block-cutvertex trees and block-cutvertex partitions
• Entropy bounds for dendrimers
• Enumeration of BC-subtrees of trees
• Enumeration of subtrees of trees
• Extremal graphs with respect to generalized ABC index
• Extremal results on average subtree density of series-reduced trees
• On spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees
• On the Wiener and terminal Wiener index of generalized Bethe trees
• On the average number of nodes in a subtree of a tree
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• Ordering chemical graphs by Randić and sum-connectivity numbers
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Subtrees of graphs
• Subtrees of spiro and polyphenyl hexagonal chains
• The average order of a subtree of a tree
• Two flow network simplification algorithms
• Wiener polarity index of dendrimers

Cited in

(8)

• 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
• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Spectral properties of balanced trees and dendrimers
• Subtrees, BC-subtrees of generalized Bethe trees and related questions.
• Enumeration of subtrees of planar two-tree networks

This page was built for publication: Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees

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