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

Resultado de la investigación: Article

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.

Idioma originalEnglish
Páginas (desde-hasta)185-190
Número de páginas6
PublicaciónElectronic Notes in Discrete Mathematics
Volumen68
DOI
EstadoPublished - 1 jul 2018

Huella dactilar

Polynomials
Polynomial
Graph in graph theory
Term
Generalization

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Citar esto

@article{aef5bca8c1fe41c3af89be327df9dd65,
title = "On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs",
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.",
keywords = "chromatic symmetric function, Stanley's conjecture, U-polynomial",
author = "Jos{\'e} Aliste-Prieto and Jos{\'e} Zamora and {de Mier}, Anna",
year = "2018",
month = "7",
day = "1",
doi = "10.1016/j.endm.2018.06.032",
language = "English",
volume = "68",
pages = "185--190",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

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

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

VL - 68

SP - 185

EP - 190

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -