TY - JOUR
T1 - On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs
AU - Aliste-Prieto, José
AU - Zamora, José
AU - de Mier, Anna
N1 - Funding Information:
1 The authors are supported by FONDECYT REGULAR 1160975 CONICYT CHILE 2 The author is supported by project MINECO MTM2017-82166-P. 3 Emails: [email protected], [email protected] 4 Email: [email protected]
Publisher Copyright:
© 2018 Elsevier B.V.
PY - 2018/7/1
Y1 - 2018/7/1
N2 - In this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is done purely in algebraic terms, after introducing and studying a generalization of the U-polynomial to rooted graphs.
AB - In this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is done purely in algebraic terms, after introducing and studying a generalization of the U-polynomial to rooted graphs.
KW - chromatic symmetric function
KW - Stanley's conjecture
KW - U-polynomial
UR - http://www.scopus.com/inward/record.url?scp=85049890853&partnerID=8YFLogxK
U2 - 10.1016/j.endm.2018.06.032
DO - 10.1016/j.endm.2018.06.032
M3 - Article
AN - SCOPUS:85049890853
SN - 1571-0653
VL - 68
SP - 185
EP - 190
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -