Binary trees with the largest number of subtrees

DOI10.1016/J.DAM.2006.05.008zbMATH Open1113.05025OpenAlexW2002459766WikidataQ60692132 ScholiaQ60692132MaRDI QIDQ868393

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

Publication date: 2 March 2007

Published in: (Search for Journal in Brave)

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

zbMATH Keywords

Wiener index

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Distance in graphs (05C12)

Cites Work

• Wiener index versus maximum degree in trees
• On subtrees of trees
• Superdominance order and distance of trees with bounded maximum degree
• On \(\alpha \)-greedy expansions of numbers
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (32)

Maximising the number of connected induced subgraphs of unicyclic graphs ⋮ Nordhaus-Gaddum inequalities for the number of connected induced subgraphs in graphs ⋮ On the eccentric subtree number in trees ⋮ Generating and enumerating digitally convex sets of trees ⋮ On \(\alpha \)-greedy expansions of numbers ⋮ On different ``middle parts of a tree ⋮ The Number of Subtrees of Trees with Given Degree Sequence ⋮ Maximum number of subtrees in cacti and block graphs ⋮ Extremal problems for connected set enumeration ⋮ The number of maximum matchings in a tree ⋮ The expected subtree number index in random polyphenylene and spiro chains ⋮ The shape of node reliability ⋮ The number of subtrees of trees with given diameter ⋮ On the Number of Nonisomorphic Subtrees of a Tree ⋮ Title not available (Why is that?) ⋮ Extremal values of ratios: distance problems vs. subtree problems in trees. II ⋮ The minimal number of subtrees with a given degree sequence ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ The Maximum Binary Tree Problem. ⋮ Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees ⋮ Extremal problems for trees with given segment 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 ⋮ Sub-trees of a random tree ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Computing the number and average size of connected sets in planar 3-trees ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees ⋮ Enumeration of BC-subtrees of trees

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

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