Trees with the mos subtrees - an algorithmic approach
From MaRDI portal
Publication:1937356
DOI10.4310/JOC.2012.v3.n2.a5zbMath1266.05013arXiv1210.2871MaRDI QIDQ1937356
Hua Wang, Daniel Gray, Xiu-Mei Zhang, Xiao Dong Zhang
Publication date: 28 February 2013
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.2871
Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)
Related Items (8)
Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ The minimal number of subtrees with a given degree sequence ⋮ On the number of connected subgraphs of graphs ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Trees with large numbers of subtrees ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ The distances between internal vertices and leaves of a tree ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
This page was built for publication: Trees with the mos subtrees - an algorithmic approach
