Enumeration of BC-subtrees of trees

DOI10.1016/j.tcs.2015.02.028zbMath1311.05085OpenAlexW3014235012MaRDI QIDQ2344772

Hong Bo Liu, Hua Wang, Yu Yang, Scott Makeig

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.028

zbMATH Keywords

enumerationBC-subtreesblock-cutpoint-treeextremal treesmiddle partbicolorable tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (10)

Enumeration of subtrees of planar two-tree networks ⋮ On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ The number of subtrees of trees with given diameter ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of subtrees of trees
• Binary trees with the largest number of subtrees
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Two flow network simplification algorithms
• On finding common subtrees
• Extremal values for ratios of distances in trees
• On subtrees of trees
• Block-cutvertex trees and block-cutvertex partitions
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
• Coverings of Bipartite Graphs
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Block cutpoint decomposition for markovian queueing systems
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Correlation of Graph‐Theoretical Indices
• An algorithm for the blocks and cutnodes of a graph
• Wiener index of trees: Theory and applications

This page was built for publication: Enumeration of BC-subtrees of trees