Binary trees with the largest number of subtrees

From MaRDI portal
Revision as of 15:18, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:868393

DOI10.1016/J.DAM.2006.05.008zbMath1113.05025OpenAlexW2002459766WikidataQ60692132 ScholiaQ60692132MaRDI QIDQ868393

Hua Wang, László A. Székely

Publication date: 2 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.05.008




Related Items (29)

Maximising the number of connected induced subgraphs of unicyclic graphsNordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphsOn the eccentric subtree number in treesGenerating and enumerating digitally convex sets of treesOn \(\alpha \)-greedy expansions of numbersOn different ``middle parts of a treeThe Number of Subtrees of Trees with Given Degree SequenceMaximum number of subtrees in cacti and block graphsExtremal problems for connected set enumerationThe number of maximum matchings in a treeThe expected subtree number index in random polyphenylene and spiro chainsThe shape of node reliabilityThe number of subtrees of trees with given diameterOn the Number of Nonisomorphic Subtrees of a TreeExtremal values of ratios: distance problems vs. subtree problems in trees. IIThe minimal number of subtrees with a given degree sequenceThe number of subtrees in graphs with given number of cut edgesSubtrees of spiro and polyphenyl hexagonal chainsEnumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in treesExtremal problems for trees with given segment sequenceOn the number of connected subgraphs of graphsOn \(\sigma\)-span and \(F\)-span of trees and full binary treesTrees with large numbers of subtreesSub-trees of a random treeSome extremal ratios of the distance and subtree problems in binary treesExtremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover costCut and pendant vertices and the number of connected induced subgraphs of a graphGeneralised outerplanar Turán numbers and maximum number of \(k\)-vertex subtreesEnumeration of BC-subtrees of trees


Uses Software



Cites Work




This page was built for publication: Binary trees with the largest number of subtrees