A tree distinguishing polynomial

2019/04/06 by Liu, Pengyu · 1 citation
#05C31 and 05C05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1904.03332

Abstract

We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree T is the generating function of a class of subtrees of T. We prove that the polynomial is a complete isomorphism invariant for unlabeled rooted trees. Then, we generalize the polynomial to unlabeled unrooted trees and we show that the generalized polynomial is a complete isomorphism invariant for unlabeled unrooted trees.

Cited by

• Edge-Span Chern Algebras of Graphical Configuration Spaces

Related

• Polynomial invariants for rooted trees related to their random destruction
• A polynomial associated with rooted trees and specific posets
• On the smallest trees with the same restricted U-polynomial and the\n rooted U-polynomial
• On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem
• Chromatic symmetric functions and polynomial invariants of trees