论文信息 - On the number of irreducible coverings by edges of complete bipartite graphs

On the number of irreducible coverings by edges of complete bipartite graphs

Abstract In this paper it is proved that the exponential generating function of the numbers, denoted by N ( p , q ), of irreducible coverings by edges of the vertices of complete bipartite graphs K p , q equals exp( xe y + ye x − x − y − xy ) − 1.

Ioan Tomescu | I. Tomescu

[1] IOAN TOMESCU. Some properties of irreducible coverings by cliques of complete multipartite graphs , 1980, J. Comb. Theory, Ser. B.

[2] Herbert S. Wilf,et al. Generating functionology , 1990 .

[3] E. J. Farrell. On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node-Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars , 1979, Canadian Mathematical Bulletin.