Algorithms for enumerating multiple leaf-distance granular regular -subtree of unicyclic and edge-disjoint bicyclic graphs
From MaRDI portal
(Redirected from Publication:6089577)
Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
Recommendations
- 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
- 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
- On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
Cites work
- A unified approach to the extremal Zagreb indices for trees, unicyclic graphs and bicyclic graphs
- An algorithm for the blocks and cutnodes of a graph
- Block cutpoint decomposition for markovian queueing systems
- Block-cutvertex trees and block-cutvertex partitions
- Complete solution for unicyclic graphs with minimum general Randić index
- Correlation of Graph‐Theoretical Indices
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
- Degree distance of unicyclic and bicyclic graphs
- Enumeration of BC-subtrees of trees
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- Enumeration of subtrees of trees
- Extremal trees with given degree sequence for the Randić index
- Extremal unicyclic and bicyclic graphs with respect to Harary index
- Extremal values of ratios: distance problems vs. subtree problems in trees. II
- Finding connected \(k\)-subgraphs with high density
- scientific article; zbMATH DE number 3270498 (Why is no real title available?)
- Largest Number of Subtrees of Trees with a Given Maximum Degree
- Mining frequent subgraphs in multigraphs
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
- On subtrees of trees
- On the minimal matching energies of unicyclic graphs
- On the number of nonisomorphic subtrees of a tree
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching
- Optimal fault-tolerant routings for connected graphs
- Planar linear arrangements of outerplanar graphs
- Semiharmonic bicyclic graphs
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time
- Sparse reliable graph backbones
- Subtrees of graphs
- Subtrees of spiro and polyphenyl hexagonal chains
- The maximum PI index of bicyclic graphs with even number of edges
- The minimal number of subtrees of a tree
- The minimal number of subtrees with a given degree sequence
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Trees with large numbers of subtrees
- Trees with the mos subtrees - an algorithmic approach
- Two flow network simplification algorithms
- Unicyclic and bicyclic graphs having minimum degree distance
- Wiener index of a fuzzy graph and application to illegal immigration networks
Cited in
(1)
This page was built for publication: Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089577)
