Tutte polynomials of generalized parallel connections

被引:6
作者
Bonin, J [1 ]
de Mier, A
机构
[1] George Washington Univ, Dept Math, Washington, DC 20052 USA
[2] Univ Politecn Catalunya, Dept Matemat Aplicada 2, Barcelona, Spain
关键词
Tutte polynomial; characteristic polynomial; weighted characteristic polynomial; matroid; generalized parallel connection; k-sum;
D O I
10.1016/S0196-8858(03)00076-9
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2003 Elsevier Inc. All rights reserved.
引用
收藏
页码:31 / 43
页数:13
相关论文
共 14 条
[1]   Splitting formulas for Tutte polynomials [J].
Andrzejak, A .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 70 (02) :346-366
[2]  
Bonin JE, 2001, DISCRETE MATH, V232, P95
[3]  
BRYLAWSKI T, 1975, T AM MATH SOC, V203, P1
[4]   COMBINATORIAL MODEL FOR SERIES-PARALLEL NETWORKS [J].
BRYLAWSKI, T .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 154 (FEB) :1-+
[5]  
BRYLAWSKI T, 1979, STUD APPL MATH, V61, P211
[6]  
Brylawski T., 1982, MATROID THEORY ITS A, P125
[7]  
Brylawski Thomas, 1992, MATROID APPL, V40, P123
[8]  
Crapo H. H., 1969, Aequationes Math., V3, P211
[9]   Tutte polynomials of perfect matroid designs [J].
Mphako, EG .
COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (04) :363-367
[10]  
Oxley J., 1993, MATROID THEORY