Maximizing the number of spanning trees on the (p,p+2) graphs

References

• Berge , C. 1976 . Graphs and hypergraphs , North-Holland/American Elsevier .
   Google Scholar
• Berge , C. 1971 . Principles of combinatorics , New York : Academic Press .
   Google Scholar
• Boesch F. T. Bogdanonicz Z. R. Minimum spanning tree graphs networks (to appear)
   Google Scholar
• Boesch F. T. Prodinger H. Spanning tree formulas and Chebyshev polynomials Networks (to appear)
   Google Scholar
• Frank , H. 1969 . Pro. 3rd Annu. Princeton Conf. Information Sciences and System . Maximally reliable node weighted graphs . March 1969 . pp. 1 – 6 .
   Google Scholar
• Harary , F. 1969 . Graph theory , Addison-Wesley Reading .
   Google Scholar
• Wang , J. F. and Wu , M. H. 1987 . Network Reliability analysis: On maximizing the number of spanning trees . Proc. Natl. Sci. Counc. ROC(A) , 11 : 238 – 244 .
   Google Scholar
• Kel'mans , A. K. 1967 . Connectivity of probabilistic networks . Automat. Remote Contr. , 3 : 444 – 460 .
   Google Scholar
• Moore , E. and Shannon , C. 1956 . Reliable circuits using less reliable relays . J. Franklin Inst. , 262 : 191 – 208 .
   Google Scholar
• Provan J. S. Ball M. O. The complexity of counting cuts and of computing the probability that a graph is connected Management Science and Statistics University of Maryland 1981 Report, 81-002
   Google Scholar
• Shier , D. R. 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
• Williams , G. 1963 . The design of survivable communication network . IEEE Trans. Commun. Syst. , CS-11 : 230 – 247 .
   Google Scholar