Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
DOI10.1016/J.AMC.2023.128334MaRDI QIDQ6089577
No author found.
Publication date: 13 November 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
generating functionunicyclic graphsedge-disjoint bicyclic graphsmultiple leaf-distance granular regular \(\alpha\)-subtree (LDR \(\alpha\)-subtree)
General topics of discrete mathematics in relation to computer science (68R01) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
- Sparse reliable graph backbones
- The minimal number of subtrees of a tree
- The minimal number of subtrees with a given degree sequence
- Degree distance of unicyclic and bicyclic graphs
- Subtrees of spiro and polyphenyl hexagonal chains
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Semiharmonic bicyclic graphs
- Enumeration of subtrees of trees
- Extremal trees with given degree sequence for the Randić index
- Two flow network simplification algorithms
- Optimal fault-tolerant routings for connected graphs
- On the minimal matching energies of unicyclic graphs
- The maximum PI index of bicyclic graphs with even number of edges
- On subtrees of trees
- Block-cutvertex trees and block-cutvertex partitions
- Trees with the mos subtrees - an algorithmic approach
- Wiener index of a fuzzy graph and application to illegal immigration networks
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
- Mining frequent subgraphs in multigraphs
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
- 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
- Finding connected \(k\)-subgraphs with high density
- 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
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Planar linear arrangements of outerplanar graphs
- Block cutpoint decomposition for markovian queueing systems
- On the Number of Nonisomorphic Subtrees of a Tree
- Subtrees of graphs
- Correlation of Graph‐Theoretical Indices
- An algorithm for the blocks and cutnodes of a graph
- Trees with large numbers of subtrees
This page was built for publication: Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
