A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function
نویسندگان
چکیده
This paper has two main parts. First, we consider the Tutte symmetric function XB, a generalization of chromatic function. We introduce vertex-weighted version XB and show that this admits deletion-contraction relation. also demonstrate spanning-tree spanning-forest expansions generalizing those polynomial by connecting to other graph functions. Second, give several methods for constructing nonisomorphic graphs with equal functions, use them provide specific examples.
منابع مشابه
A Noncommutative Chromatic Symmetric Function
In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...
متن کاملcompactifications and function spaces on weighted semigruops
chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...
15 صفحه اولThe Chromatic Symmetric Function of Almost Complete Graphs
The chromatic symmetric function of a graph is a symmetric function that generalizes the chromatic polynomial. Its investigation has largely been motivated by the existence of an open problem, the poset-chain conjecture, which is equivalent to the assertion that for certain graphs, the coefficients in the expansion of the chromatic symmetric function in terms of elementary symmetric functions, ...
متن کاملA Chromatic Symmetric Function in Noncommuting Variables
In [12], Stanley associated with a graph G a symmetric function XG which reduces to G’s chromatic polynomial XG(n) under a certain specialization of variables. He then proved various theorems generalizing results about XG(n), as well as new ones that cannot be interpreted on the level of the chromatic polynomial. Unfortunately, XG does not satisfy a Deletion-Contraction Law which makes it diffi...
متن کاملA Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in terms of the monomial symmetric functions, mλ, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2021
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10018