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


Maximizing the number of spanning trees on the (p,p+2) graphs
Abstract:This paper considers the problem of maximizing the number of spanning trees. A newly established result is the formula and the graph topology for the maximum number of spanning trees among the class of (p, p+2) graph.
Keywords:(p  p+2) block  spanning tree  cut point
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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