Maximizing the number of spanning trees of networks based on cycle basis representation

References

• Boesch , F. T. and Bogdanowicz , Z. R. 1987 . The number of spanning trees in a prism . Internat. J. Comput. Math. , 21 : 229 – 243 .
   Web of Science ®Google Scholar
• Bondy , J. A. and Murty , U. S. 1976 . Graph Theory with Application , Landon : The MacMillan Press Ltd. .
   Google Scholar
• Kel'mans , A. K. 1967 . Connectivity of probabilistic networks . Automat. Romote Contr. , 3 : 444 – 460 .
   Google Scholar
• 1974 . Maximizing the number of spanning trees in a graph with n nodes and m edges . Journal of Research N. B. S. , 78B : 193 – 196 .
   Google Scholar
• Wang , J. F. and Wu , M. H. 1987 . Network reliability analysis: on maximizing the number of spanning trees, Proc . Nati. Sci. Counc. ROC(A) , 11 ( 3 ) : 238 – 244 .
   Google Scholar
• Wang , J. F. and Yang , C. S. 1984 . On the number of trees of circulant graphs . Internat. J. Comput. Math. , 16 ( 3 ) : 229 – 241 .
   Google Scholar