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

dc.contributor.author	Aliste-Prieto, José
dc.contributor.author	Zamora, José
dc.contributor.author	de Mier, Anna
dc.date.accessioned	2022-07-27T23:34:03Z
dc.date.available	2022-07-27T23:34:03Z
dc.date.issued	2018-07
dc.description	Indexación Scopus	es
dc.description.abstract	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. © 2018 Elsevier B.V.	es
dc.description.uri	https://www-sciencedirect-com.recursosbiblioteca.unab.cl/science/article/pii/S1571065318301239?via%3Dihub
dc.identifier.citation	Electronic Notes in Discrete Mathematics Volume 68, Pages 185 - 190July 2018	es
dc.identifier.doi	10.1016/j.endm.2018.06.032
dc.identifier.issn	15710653
dc.identifier.uri	https://repositorio.unab.cl/xmlui/handle/ria/23369
dc.language.iso	en	es
dc.publisher	Elsevier B.V.	es
dc.rights.license	CC BY-NC-ND 4.0
dc.subject	Extremal Graphs	es
dc.subject	Chromatic Polynomial	es
dc.subject	Chromatic symmetric function	es
dc.subject	Stanley's conjecture	es
dc.subject	U-polynomial	es
dc.title	On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs	es
dc.type	Artículo	es

Mostrando 1 - 1 de 1

Mostrando 1 - 1 de 1