On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs
Cargando...
Archivos
Fecha
2018-07
Profesor/a Guía
Facultad/escuela
Idioma
en
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier B.V.
Nombre de Curso
Licencia CC
CC BY-NC-ND 4.0
Licencia CC
Resumen
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.
Notas
Indexación Scopus
Palabras clave
Extremal Graphs, Chromatic Polynomial, Chromatic symmetric function, Stanley's conjecture, U-polynomial
Citación
Electronic Notes in Discrete Mathematics Volume 68, Pages 185 - 190July 2018
DOI
10.1016/j.endm.2018.06.032