On enumerating algorithms of novel multiple leaf-distance granular regular -subtrees of trees

DOI10.1016/J.IC.2022.104942MaRDI QIDQ2105426zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe 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
• Enumeration of BC-subtrees of trees

Cites work

• scientific article; zbMATH DE number 3270498 (Why is no real title available?)
• An algorithm for the blocks and cutnodes of a graph
• Atom-bond connectivity index of graphs
• Block cutpoint decomposition for markovian queueing systems
• Block-cutvertex trees and block-cutvertex partitions
• Correlation of Graph‐Theoretical Indices
• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
• 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 results on average subtree density of series-reduced trees
• Finding connected \(k\)-subgraphs with high density
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Mining frequent subgraphs in multigraphs
• On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• On the local and global means of subtree orders
• 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
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time
• Sparse reliable graph backbones
• Stack and Queue Layouts of Directed Acyclic Graphs: Part II
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• Subtrees of spiro and polyphenyl hexagonal chains
• The average order of a subtree of a tree
• The expected subtree number index in random polyphenylene and spiro chains
• The minimal number of subtrees with a given degree sequence
• Trees with large numbers of subtrees
• Trees with the mos subtrees - an algorithmic approach
• Two flow network simplification algorithms
• Wiener index of trees: Theory and applications

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105426)