On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees

DOI10.1016/j.ic.2022.104942OpenAlexW4285606494MaRDI QIDQ2105426

Yanyan Li

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104942

zbMATH Keywords

algorithmgenerating functionenumerationweightleaf-distance granular regular \(\alpha\)-subtree (LDR \(\alpha\)-subtree)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs

Cites Work

• Unnamed Item
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• Extremal results on average subtree density of series-reduced trees
• Sparse reliable graph backbones
• The minimal number of subtrees with a given degree sequence
• Subtrees of spiro and polyphenyl hexagonal chains
• Atom-bond connectivity index of graphs
• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
• Enumeration of subtrees of trees
• The average order of a subtree of a tree
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Two flow network simplification algorithms
• Optimal fault-tolerant routings for connected graphs
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• Block-cutvertex trees and block-cutvertex partitions
• Trees with the mos subtrees - an algorithmic approach
• Mining frequent subgraphs in multigraphs
• The expected subtree number index in random polyphenylene and spiro chains
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• Enumeration of BC-subtrees of trees
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• Finding connected \(k\)-subgraphs with high density
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• On the Local and Global Means of Subtree Orders
• Planar linear arrangements of outerplanar graphs
• Block cutpoint decomposition for markovian queueing systems
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• On the Number of Nonisomorphic Subtrees of a Tree
• Correlation of Graph‐Theoretical Indices
• An algorithm for the blocks and cutnodes of a graph
• Trees with large numbers of subtrees
• Wiener index of trees: Theory and applications

This page was built for publication: On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees