The number of spanning trees of the regular networks

References

• Armstrong , J. R. and Gray , F. G. 1981 . Fault diagnosis in a Boolean n-cube array of microprocessors . IEEE Trans. Comput. , 30 : 587 – 590 .
   Web of Science ®Google Scholar
• Bhat K. V. S. An efficient approach to fault diagnosis in a Boolean n-cube array of microprocessors Tech. Rep. 81 Dept. of Computer Science, Univ. of Iowa Iowa City
   Google Scholar
• Frank , H. 1969 . Pro. 3rd Ann. Princeton Conf., Information Science and Systems . Maximally reliable node weighted graphs . 1969 . pp. 1 – 6 .
   Google Scholar
• Graybill , F. A. 1983 . Matrices with Applications in Statistics , Belmont, California : Wadsworth Intern. Group .
   Google Scholar
• Harary , F. 1969 . Graph Theory , Reading : Addison-Wesley .
   Google Scholar
• Hawkes , L. W. 1967 . A regular fault-tolerant architecture for interconnection networks . IEEE Trans. Comput. , C34 ( 7 ) : 677 – 680 .
   Google Scholar
• Kelmans , A. K. 1967 . Connectivity of probablistic networks . Auto Remote Contr. , 3 ( 7 ) : 444 – 460 .
   Google Scholar
• Kirchhoff , G. 1947 . Uber die auflosung der gleichungen, auf welche man bei der untersuchung der lineren verteilung galvanischer strome gefuhrt wird . Ann. Phys. Chem. , 72 ( 7 ) : 497 – 508 .
   Google Scholar
• Moore , E. and Shannon , C. 1956 . Reliable circuits using less reliable relays . J. Franklin Inst. , 262 ( 7 ) : 191 – 208 .
   Google Scholar
• Sedlacek , J. 1970 . “ On the skeletons of a graph or digraph ” . In Combinatorial Structures and Their Applications , Edited by: Guy , R. , Hanani , M. , Saver , N. and Schonheim , J. 387 – 391 . New York : Gordon and Breach .
   Google Scholar
• Sedlacek , J. 1970 . “ On the skeletons of a graph or digraph ” . In Combinatorial Structures and Their Applications , Edited by: Guy , R. , Hanani , M. , Saver , N. and Schonheim , J. 387 – 391 . New York : Gordon and Breach .
   Google Scholar
• Sullivan , H. and Bashkow , T. R. 1977 . Proc. IEEE 1977 Comput. Arch . A large scale, homogeneous, fully distributed parallel machine, I . 1977 . pp. 105 – 117 .
   Google Scholar
• Wang , J. F. and Yang , C. S. 1984 . On the number of spanning trees of circulant graphs . Intern. J. Computer Math. , 16 : 229 – 241 .
   Web of Science ®Google Scholar
• Williams , G. 1963 . The design of survivable communication network . IEEE Trans. Commun. Syst. , CS11 : 230 – 247 .
   Google Scholar
• Wilkov , R. S. 1972 . Analysis and design of reliable computer networks . IEEE Trans. Commun. , COM20 : 660 – 678 .
   Google Scholar
• Yang , C. S. , Wang , J. F. , Lee , J. Y. and Boesch , F. T. 1986 . Graph theoretic reliability analysis for the Boolean n-cube network . IEEE Trans. Circuit and Systems , Submitted to
   Google Scholar