论文信息 - Tutte polynomials of generalized parallel connections

Tutte polynomials of generalized parallel connections

We 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.

Joseph E. Bonin | Anna de Mier | A. Mier

[1] Paul D. Seymour,et al. A generalization of chordal graphs , 1984, J. Graph Theory.

[2] U. Faigle,et al. Book reviews , 1991, ZOR Methods Model. Oper. Res..

[3] G. Rota. On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[4] Tom Brylawski,et al. Modular constructions for combinatorial geometries , 1975 .

[5] Joseph E. Bonin,et al. Tutte polynomials of q-cones , 2001, Discret. Math..

[6] James G. Oxley,et al. Matroid theory , 1992 .

[7] Eunice Gogo Mphako. Tutte Polynomials Of Perfect Matroid Designs , 2000, Comb. Probab. Comput..

[8] H. Crapo,et al. The Tutte polynomial , 1969, 1707.03459.

[9] D. Welsh. Complexity: Knots, Colourings and Counting: Link polynomials and the Tait conjectures , 1993 .

[10] Tom Brylawski,et al. A combinatorial model for series-parallel networks , 1971 .

[11] Thomas Zaslavsky,et al. Combinatorial Geometries: The Möbius Function and the Characteristic Polynomial , 1987 .

[12] Dominic Welsh,et al. The Tutte polynomial , 1999, Random Struct. Algorithms.

[13] Artur Andrzejak,et al. Splitting Formulas for Tutte Polynomials , 1997, J. Comb. Theory, Ser. B.

[14] Tom Brylawski,et al. Intersection Theory for Embeddings of Matroids into Uniform Geometries , 1979 .