On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs

Aliste-Prieto, JoséZamora, Joséde Mier, Anna2022-07-272022-07-272018-07Electronic Notes in Discrete Mathematics Volume 68, Pages 185 - 190July 201815710653https://repositorio.unab.cl/xmlui/handle/ria/23369Indexación ScopusIn 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. © 2018 Elsevier B.V.enExtremal GraphsChromatic PolynomialChromatic symmetric functionStanley's conjectureU-polynomialOn graphs with the same restricted U-polynomial and the U-polynomial for rooted graphsArtículoCC BY-NC-ND 4.010.1016/j.endm.2018.06.032