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


A lower bound on the number of spanning trees with k end-vertices
Authors:Katherine Heinrich  Guizhen Liu
Abstract:If a graph G with cycle rank ρ contains both spanning trees with m and with n end-vertices, m < n, then G has at least 2ρ spanning trees with k end-vertices for each integer k, m < k < n. Moreover, the lower bound of 2ρ is best possible.
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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