On the number of irreducible coverings by edges of complete bipartite graphs
Author/Authors :
Ioan Tomescu، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Pages :
4
From page :
453
To page :
456
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 Kp,q equals exp(xey + yex − x − y − xy) − 1.
