On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
From MaRDI portal
Publication:260059
DOI10.1016/j.dam.2015.09.025zbMath1332.05080OpenAlexW2203616559MaRDI QIDQ260059
Shigang Feng, Hua Wang, Yu Yang, Hong Bo Liu
Publication date: 18 March 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.025
generating functionenumerationunicyclic graphsBC-subtreesblock-cutpoint-treeedge-disjoint bicyclic graphs
Trees (05C05) Applications of graph theory (05C90) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (5)
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 ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree distance of unicyclic and bicyclic graphs
- Subtrees of spiro and polyphenyl hexagonal chains
- Enumeration of subtrees of trees
- Extremal trees with given degree sequence for the Randić index
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- Two flow network simplification algorithms
- A new technique for the characterization of graphs with a maximum number of spanning trees
- On subtrees of trees
- Block-cutvertex trees and block-cutvertex partitions
- Enumeration of BC-subtrees of trees
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching
- Extremal unicyclic and bicyclic graphs with respect to Harary index
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Unicyclic and bicyclic graphs having minimum degree distance
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
- 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
- An algorithm for the blocks and cutnodes of a graph
This page was built for publication: On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
