Linear Relations for a Generalized Tutte Polynomial
نویسندگان
چکیده
منابع مشابه
Linear Relations for a Generalized Tutte Polynomial
Brylawski proved the coefficients of the Tutte polynomial of a matroid satisfy a set of linear relations. We extend these relations to a generalization of the Tutte polynomial that includes greedoids and antimatroids. This leads to families of new identities for antimatroids, including trees, posets, chordal graphs and finite point sets in Rn. It also gives a “new” linear relation for matroids ...
متن کاملGeneralized star configurations and the Tutte polynomial
From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the matrix is generic and we obtain the usual star configurations. In our main result, we show that the degree of a generalized star configuration as a projective ...
متن کاملGeneralized activities and the tutte polynomial
The notion of activities with respect to spanning trees in graphs was introduced by W.T. Tutte, and generalized to activities with respect to bases in matroids by H. Crapo. We present a further generalization, to activities with respect to arbitrary subsets of matroids. These generalized activities provide a unified view of several different expansions of the Tutte polynomial and the chromatic ...
متن کاملThe Tutte Polynomial and Linear Codes
A linear code of length n and dimension k is called a [n, k]-code. If G is a r × n matrix over GF (q), whose rows form a basis for C, then G is a generator matrix for C. As with every matrix, there is an associated matroid, which in this case depends only on C. Hence the matroid is M(C). The dual code, C∗, of C, is defined by C∗ = {v ∈ GF (q)n|v · w = 0 ∀w ∈ C}. If C is a [n, k]-code, then C∗ i...
متن کاملThe Tutte polynomial and the generalized Petersen graph
GraphsG andH are T -equivalent if they have the same Tutte polynomial. G is T -unique if any arbitrary graph H being T -equivalent to G implies that H is isomorphic to G. We show that the generalized Petersen graph P (m, 2) and the line graph of P (m, 2) are T -unique. 1 The Tutte Polynomial Let G be a graph with vertex set V and edge set E, and let G[A] denote the subgraph ofG induced by the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2015
ISSN: 1077-8926
DOI: 10.37236/4534