The minimal number of subtrees with a given degree sequence

DOI10.1007/S00373-013-1383-ZzbMATH Open1306.05031OpenAlexW2092565390MaRDI QIDQ489367FDOQ489367

Authors: Xiumei Zhang, Xiao-Dong Zhang 

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1383-z

Recommendations

• The minimal number of subtrees of a tree
• The number of subtrees of trees with given degree sequence
• Trees with the mos subtrees - an algorithmic approach
• Extremal trees with fixed degree sequence
• Further analysis on the total number of subtrees of trees

zbMATH Keywords

degree sequencesubtreecaterpillar

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Enumeration in graph theory (05C30)

Cites Work

• On subtrees of trees
• Title not available (Why is that?)
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• Enumeration of subtrees of trees
• Title not available (Why is that?)
• The Number of Subtrees of Trees with Given Degree Sequence
• The Wiener maximum quadratic assignment problem
• The extremal values of the Wiener index of a tree with given degree sequence
• Binary trees with the largest number of subtrees
• Non-isomorphic caterpillars with identical subtree data
• The sum of the distances between the leaves of a tree and the `semi-regular' property
• Title not available (Why is that?)
• The average order of a subtree of a tree
• Title not available (Why is that?)
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Trees with the mos subtrees - an algorithmic approach
• On \(\alpha \)-greedy expansions of numbers
• Title not available (Why is that?)
• Correlation of Graph‐Theoretical Indices
• Extended formulations for the cardinality constrained subtree of a tree problem

Cited In (19)

• On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees
• Extremal problems for connected set enumeration
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
• Extremal trees with respect to dominance order.
• On majorization of closed walk vectors of trees with given degree sequences
• Subtrees of spiro and polyphenyl hexagonal chains
• Minimum degree and minimum number of edge-disjoint trees
• The shape of node reliability
• On the number of connected subgraphs of graphs
• Eccentricity sums in trees
• Title not available (Why is that?)
• Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices
• The distances between internal vertices and leaves of a tree
• The expected subtree number index in random polyphenylene and spiro chains
• The number of subtrees in graphs with given number of cut edges
• Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs
• Extremal problems for trees with given segment sequence
• On the roots of the subtree polynomial
• Subforests of bipartite digraphs---the minimum degree condition

This page was built for publication: The minimal number of subtrees with a given degree sequence

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