The Equivalence of Two Graph Polynomials and a Symmetric Function

DOI10.1017/S0963548309009845zbMath1194.05060arXiv0805.4793OpenAlexW2123147723MaRDI QIDQ3552515

Criel Merino, Steven D. Noble

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.4793

Mathematics Subject Classification ID

Graph polynomials (05C31) Symmetric functions and generalizations (05E05) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Related Items

A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function ⋮ More connections between the matching polynomial and the chromatic polynomial ⋮ On sequences of polynomials arising from graph invariants ⋮ On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial ⋮ A logician's view of graph polynomials ⋮ Thomas H. Brylawski (1944--2007) ⋮ A tree distinguishing polynomial ⋮ On the location of roots of graph polynomials ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic ⋮ Modular relations of the Tutte symmetric function

Cites Work

• Unnamed Item
• Unnamed Item
• A correlation inequality involving stable set and chromatic polynomials
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Intersection theory for graphs
• A weighted graph polynomial from chromatic invariants of knots
• The coloring of graphs
• Polychromatic polynomials
• The polychromate and a chord diagram polynomial
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• A symmetric function generalization of the chromatic polynomial of a graph