首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On the number of irreducible coverings by edges of complete bipartite graphs
Authors:Ioan Tomescu
Institution:

Faculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

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 + yexxyxy) − 1.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号