Add to ORKGWe use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel connections in the case in which the simplification of the maximal common restriction of the two constituent matroids is a modular flat of the simplifications of both matroids. In particular, this includes cycle matroids of graphs that are identified along complete subgraphs. We also develop formulas for Tutte polynomials of the k-sums that are obtained from such generalized parallel connections
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially e...
AbstractWe use weighted characteristic polynomials to compute Tutte polynomials of generalized paral...
AbstractWe give formulas for the Tutte polynomials of parallel and series connections of weighted ma...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AbstractWe present two splitting formulas for calculating the Tutte polynomial of a matroid. The fir...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
We give some reduction formulas for computing the Tutte polynomial of any graph with parallel class...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractWe discuss reducing the number of steps involved in computing the Tutte polynomial of a matr...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag v...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially e...
AbstractWe use weighted characteristic polynomials to compute Tutte polynomials of generalized paral...
AbstractWe give formulas for the Tutte polynomials of parallel and series connections of weighted ma...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AbstractWe present two splitting formulas for calculating the Tutte polynomial of a matroid. The fir...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
We give some reduction formulas for computing the Tutte polynomial of any graph with parallel class...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractWe discuss reducing the number of steps involved in computing the Tutte polynomial of a matr...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag v...
AbstractWe give a general convolution–multiplication identity for the multivariate and bivariate ran...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially e...