On the number of spanning trees of circulant graphs

References

• Ad'am , A. 1967 . Research problem 2-10 . J. Comb. Theory , 2 : 393
   Google Scholar
• Alspach , B. and Parsons , T. D. 1979 . Isomorphism of circulant graphs and digraph . Discrete Math , 25 : 97 – 108 .
   Web of Science ®Google Scholar
• Bauer , D. , Boesch , F. , Suffel , C. and Tindell , R. 1981 . “ Connectivity extremal problem and the design of reliable probabilistic networks ” . In The Theory and Application of Graphs , 45 – 54 . New York : Wiley .
   Google Scholar
• Berggre , J. L. 1972 . An algebraic characterization of symmetric graphs with a prime number of vertices . Bull. Austrial. Math. Soc , 7 : 131 – 134 .
   Google Scholar
• Boesch , F. and Wang , J. F. 1972 . The number of spanning trees in the square of a cycle: A conjecture . Fibonacci Quarterly , 7 To appear in the
   Google Scholar
• Boesch , F. 1976 . Large‐Scale Networks Theory and Design , IEEE Press .
   Google Scholar
• Foesch , F. and Tindeli , R. 1982 . Circulants and Their Connectivity , Steven Institute of Technology . Dept. of EECS
   Google Scholar
• Elspas , B. and Turner , J. 1970 . Graphs with circulant adjacency matrices . J. Comb. Theory , 9 : 297 – 307 .
   Google Scholar
• Frank , H. 1969 . “ Pro. 3rd Annu. Princeton Conf. Information Sciences and System ” . In Maximally Reliable Node Weighted Graphs 1 – 6 . Princeton Mar
   Google Scholar
• Harary , F. 1969 . “ Reading ” . In Graph Theory , Addison‐Wesley .
   Google Scholar
• Harary , F. 1962 . “ Proc. Nat. Acad. of Sci ” . In The Maximum Connectivity of a Graph Vol. 48 , 1142 – 1146 . USA
   Google Scholar
• Kel'mans , A. K. 1967 . Connectivity of probabilistic networks . Automat. Remote Contr , 3 : 444 – 460 .
   Google Scholar
• Kirchhoff , G. 1967 . Uber die Auflölsung der Gleichungen, auf welche man bei der Untersuchung der Linearen Verteilung galvanischer Ströme geführt wird . Ann. Phy. Chem , 72 : 496 – 508 .
   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. and Ball , Michael O. 1981 . “ The complexity of counting cuts and of computing the probability that a graph is connected ” . In Management Science and Statistics Report 81 – 002 . U. of Maryland
   Google Scholar
• Tindell , R. 1982 . The connectivity of a graph and its complement . Annals of Discrete Math , 13 : 191 – 202 .
   Google Scholar
• Tucker , A. 1980 . Applied Combinatorics , New York : John Wiley & Sons .
   Google Scholar
• Wang , J. F. 1983 . “ Ph.D. dissertation ” . Stevens Institute of Technology Hoboken N.J . 07030
   Google Scholar
• Watkins , H. E. 1970 . Connectivity of transitive graphs . J. Comb. Theory , 8 : 23 – 29 .
   Google Scholar
• Williams , G. 1963 . The design of survivable communication network . IEEE Trans. Commun. Syst , CS-11 : 230 – 247 .
   Google Scholar
• Wilkov , R. S. 1969 . Analysis and design of reliable computer network . IEEE Trans. on Circuit Theory , CS-11 : 158 – 176 .
   Google Scholar