Enumeration of one class of plane weighted trees

DOI10.1007/S10958-015-2503-5MaRDI QIDQ498531zbMATH OpenOpenAlexFDO

Authors Yu. Yu. Kochetkov

Publication date 28 September 2015

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.6208

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Abstract: By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we can color its vertices in two colors, black and white so, that adjacent vertices have different colors. A type is a set of pairwise non-isotopic plane weighted trees with a given list of weights of white vertices and a given list of weights of black vertices. In this work we present a method for computing the cardinality of a given type.

Recommendations

• scientific article; zbMATH DE number 1080074
• scientific article; zbMATH DE number 3863230
• Enumeration of subtrees of trees
• Correspondences between plane trees and binary sequences
• A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes

Cites work

• Anti-Vandermonde systems and plane trees
• Minimum degree of the difference of two polynomials over~\({\mathbb Q}\), and weighted plane trees

Cited in

(4)

• Minimum degree of the difference of two polynomials over~\({\mathbb Q}\), and weighted plane trees
• Enumeration of weighted plane trees
• scientific article; zbMATH DE number 3205162 (Why is no real title available?)
• Tiered trees, weights, and \(q\)-Eulerian numbers

This page was built for publication: Enumeration of one class of plane weighted trees

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