determinantal generating functions of colored spanning forests行列式产生颜色的生成森林的函数.pdfVIP

IJMMS 2004:6, 273–283 PII. S0161171204302206 © Hindawi Publishing Corp. DETERMINANTAL GENERATING FUNCTIONS OF COLORED SPANNING FORESTS GREGORY M. CONSTANTINE and MARIUS G. BULIGA Received 24 February 2003 The color type of a spanning forest of a graph with colored edges is defined and, subse- quently, it is proved that the generating function of such spanning forests is obtained as the formal expansion of a certain determinant. An analogous determinantal expansion yields the generating function of all spanning forests of a given color type that contain a specific subforest. Algorithms are described for obtaining a list of all colored spanning trees and spanning forests of any graph with colored edges based on symbolic calculation. 2000 Mathematics Subject Classification: 05C05, 05A15, 15A15. 1. Colored spanning forests. We start out by defining colored trees and forests in a graph with colored edges. The generating function of such objects is then introduced. Relying on the concept of tree-monomial matrices, we then prove that the generating function of a certain type of colored spanning forests is equal to the formal expansion of a determinant. Let G be a graph with n + 1 vertices denoted by 1, 2,...,n + 1. Denote by C a set of cardinality s , the elements of which are called colors. Assume that each edge of G is colored with one of the s colors in C. To edge ij, we associate the indeterminate xij . When the color c of edge ij is of the essence, we append an additional index and write xijc . Superscripts of the form x (k) are used to allow for multiple edges of the same ijc color between two vertices. We refer to Berge [4] and Constantine [7, Chapter 4] for the basic concepts of grap