On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees

DOI10.1016/j.ipl.2022.106302OpenAlexW4287511962MaRDI QIDQ2169441

Abolfazl Poureidi

Publication date: 2 September 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106302

zbMATH Keywords

algorithmsenumerationeccentric subtree numberglobal and local mean of treesnumber of subtrees and BC-subtrees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Subtrees of spiro and polyphenyl hexagonal chains
• Monotonicity of the mean order of subtrees
• On the eccentric subtree number in trees
• Enumeration of subtrees of trees
• The average order of a subtree of a tree
• Two flow network simplification algorithms
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• Enumeration of BC-subtrees of trees
• Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
• On the Local and Global Means of Subtree Orders
• Subtrees of graphs
• Maximizing the mean subtree order

This page was built for publication: On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees