期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2011
卷号：29
期号：1
出版社：Journal of Theoretical and Applied
摘要：Graph theory is used to represent a communication network by expressing its linkage structure, the vertices represent objects and the pairs called edges or represent the interconnections between objects. The exact geometric positions of vertices or the lengths of the edges are not important. The purpose of this paper is to find a recursive relation counting the number of spanning tree in Butterfly map that illustrate a connection problem suggested by Erd�s and R�nyi in 1962: Let there be given a country with n cities, n large, so that a direct air connection between two cities would require two busy airports. Considering the capacity limits of the airport, what is the number of flights that would get a passenger from any one city to another so that he needs change planes not more than once? Many results of this problem were given in the past [1], [4]
