Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes

Discrete Applied Mathematics

Volumn 67, Issue 1-3, 1996, Pages 51-66

  Brown, T J N ^a   Mallion, R B ^a   Pollak, P ^a   Roth, A ^b  

^a King's School   (United Kingdom)

^b MAX PLANCK INSTITUTE FOR MEDICAL RESEARCH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011560449     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(96)85158-4     Document Type: Article

References (82)

1. J. Aihara, General rules for constructing Hückel molecular orbital characteristic polynomials, J. Am. Chem. Soc. 98 (1976) 6840-6844.
2. A.C. Aitken, Determinants and Matrices, Section 37 (Oliver & Boyd, Edinburgh, 2nd ed., 1942) 87-88.
3. K. Balasubramanian, personal communication to R.B.M. 27 June 1990.
4. 60 clusters and other systems, J. Comput. Chem. 9 (1988) 406-415.
5. K. Balasubramanian and X. Liu, Spectra and characteristic polynomials of polyhedral clusters, Int. J. Quant. Chem. Quant. Chem. Symp. 22 (1988) 319-328.
6. N. Biggs, Algebraic Graph Theory (Cambridge Univ. Press, Cambridge, 1974) 38.
7. C.W. Borchardt, Über eine der Interpolation entsprechende Darstellung der Eliminations-Resultante, J. Reine Angew. Math. 57 (1860) 111-121.
8. R.L. Brooks, C.A.B. Smith and W.T. Tutte, The dissection of rectangles into squares, Duke Math. J. 7 (1940) 312-340.
9. T.J.N. Brown, R.B. Mallion, P. Pollak, B.R.M. de Castro and J.A.N.F. Gomes, The number of spanning trees in Buckminsterfullerene, J. Comput. Chem. 12 (1991) 1118-1124.
10. W. Byers Brown, High symmetries in quantum chemistry, Chem. Phys. Lett. 136 (1987) 128-133.
11. S.R. Caplan and D. Zeilberger, T.L. Hill's graphical method for solving linear equations, Adv. Appl. Math. 3 (1982) 377-383.
12. S. Chaiken, A combinatorial proof of the all minors matrix tree theorem, SIAM J. Algebra Discrete 3 (1982) 319-329.
13. S. Chaiken and D.J. Kleitman, Matrix tree theorems, J. Comb. Theory A 24 (1978) 377-381.
14. W.K. Chen, Unified theory on the generation of trees of a graph, Parts I, II and III, Int. J. Electronics 27 (1969) 101-117, 319-336; 31 (1971) 301-319.
15. W.K. Chen, Unified theory on the generation of trees of a graph, Parts I, II and III, Int. J. Electronics 27 (1969) 101-117, 319-336; 31 (1971) 301-319.
16. W.K. Chen, Applied Graph Theory, Graphs and Electrical Networks (North Holland, Amsterdam, 1976).
17. D.M. Cvetković, Graphs and their spectra, Publications de la Faculté d'Electrotechnique de l'Université à Belgrade (Série: Mathématiques et Physique) No. 354-356 (1971) 1-50.
18. D. Cvetković, M. Doob and H. Sachs, Spectra of Graphs: Theory and Application (Johann Ambrosius Barth, Heidelberg, 1995, 3rd edn.) 18-20, 38 & 39.
19. S.S. d'Amato, Eigenvalues of graphs with two-fold symmetry, Mol. Phys. 37 (1979) 1363-1369.
20. R. A. Davidson, Spectral analysis of graphs by cyclic automorphism subgroups, Theoret. Chim. Acta 58 (1981) 193-231.
21. J.R. Dias, A facile Hückel molecular orbital solution of Buckminsterfullene (sic) using chemical graph theory, J. Chem. Educ. 66 (1989) 1012-1015.
22. M. Fiedler and J. Sedláek, O w-basish orientovaných grafů, Časopis Pěst. Mat. 83 (1958) 214-225 (in Czech).
23. P.W. Fowler and J. Woolrich, π-Systems in three dimensions, Chem. Phys. Lett. 127 (1986) 78-82.
24. F.R. Gantmacher, The Theory of Matrices, Vol. II (Chelsea, New York, 1960) 53-66.
25. A.L. Goodson, Nomenclature of chemical compounds, in: D. Bonchev and D. H. Rouvray, eds., Chemical Graph Theory: Introduction and Fundamentals (Abacus Press/Gordon & Breach, New York, 1991) 97-132.
26. A. Graovac, O.E. Polansky, N. Trinajstić and N. Tyutyulkov, Graph theory in chemistry II Graphtheoretical description of heteroconjugated molecules, Z. Naturforsch. 30a (1975) 1696-1699.
27. I. Gutman and R.B. Mallion, On spanning trees in catacondensed molecules. Z. Naturforsch. 48a (1993) 1026-1030.
28. I. Gutman, R.B. Mallion and J. W. Essam, Counting the spanning trees of a labelled molecular-graph, Mol. Phys. 50 (1983) 859-877.
29. G.G. Hall, On the eigenvalues of molecular graphs, Mol. Phys. 33 (1977) 551-557.
30. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969) 152-154.
31. 2 hybridised carbon atoms, Chem. Phys. Lett. 122 (1985) 421-424.
32. E. Heilbronner, Ein graphisches Verfahren zur Faktorisierung der Säkulardeterminante aromatischer Ringsysteme in Rahmen der LCAO-MO-Theorie, Helv. Chim. Acta 37 (1954) 913-921.
33. H. Hutschenreuther, Einfacher Beweis des "Matrix-Gerüst-Satzes" der Netzwerktheorie, Wiss. Z. Tech. Hochsch. Ilmenau 35 (1967) 403-404.
34. P. John, A simple result connected with the spanning tree number of a graph, Wiss. Z. Tech. Hochsch. Ilmenau 35 (1989) 41-44.
35. P.E. John and R.B. Mallion, An algorithmic approach to the number of spanning trees in Buckminsterfullerene, J. Math. Chem. 15 (1994) 261-271; see also J. Math. Chem. 15 (1994) 389-390 (Erratum).
36. P.E. John and R.B. Mallion, An algorithmic approach to the number of spanning trees in Buckminsterfullerene, J. Math. Chem. 15 (1994) 261-271; see also J. Math. Chem. 15 (1994) 389-390 (Erratum).
37. P. John and H. Sachs, Calculating the characteristic polynomial, eigenvectors and number of spanning trees of a hexagonal system, J. Chem. Soc. Faraday Trans. 86 (1990) 1033-1039.
38. P. John and H. Sachs, Calculating the number of perfect matchings and of spanning trees, Pauling's orders, the characteristic polynomial and the eigenvectors of a benzenoid system, Topics Current Chem. 153 (1990) 145-179.
39. A.K. Kel'mans, Properties of the characteristic polynomial of a graph, in: Kibernotiky - na Službu Kommunizmu (Cyberneticians - to the Service of Communism), Vol. 4, Energija (Moscow & Leningrad, 1967), 27-41 (in Russian).
40. R.B. King, Symmetry factoring of the characteristic equations of graphs corresponding to polyhedra, Theoret. Chim. Acta 44 (1977) 223-243.
41. E.C. Kirby, R.B. Mallion and P. Pollak, Toroidal polyhexes, J. Chem. Soc. Faraday Trans. 89 (1993) 1945-1953.
42. E.C. Kirby, R.B. Mallion and P. Pollak, On the question of counting spanning trees in labelled, non-planar graphs, Mol Phys. 83 (1994) 599-602.
43. G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem. 72 (1847) 497-508;
44. (a) an English translation (J. B. O'Toole), On the solution of the equations obtained from the investigation of the linear distribution of galvanic currents, I. R. E. Trans. Circuit Theory, CT5 (1958) 4-7;
45. (b) another (partial) English translation is in: N.L. Biggs, E.K. Lloyd and R.J. Wilson, Graph Theory 1736-1936 (Oxford Univ. Press, Oxford, 1976) 133-135.
46. K. Kovačević, A. Graovac and D. Babić, On the hybridization in some Archimedean carbon clusters, Int. J. Quant. Chem. Quant. Chem. Symp. 21 (1987) 589-593.
47. 60: a new form of carbon, Nature 347 (1990) 354-357.
48. 60: Buckminsterfulleren, die Himmelssphäre, die zur Erde fiel, Angewandte Chem. 104 (1992) 113-133.
49. 60: Buckminsterfulleren, die Himmelssphäre, die zur Erde fiel, Angewandte Chem. 104 (1992) 113-133.
50. H.W. Kroto, A.W. Atlaf and S.P. Balm, C60: Buckminsterfullerene, Chem. Rev. 91 (1991) 1213-1235.
51. H.W. Kroto, J.E. Fischer and D.E. Cox, eds., The Fullerenes (Pergamon Press, Oxford, 1993).
52. 60: Buckminsterfullerene, Nature 318 (1985) 162-163.
53. X. Liu, Computationally-oriented combinatorial and graph-theoretical applications to chemistry, Ph.D. Dissertation, Arizona State University, 1989.
54. R.B. Mallion, On the number of spanning trees in a molecular graph, Chem. Phys, Lett. 36 (1975) 170-174.
55. R.B. Mallion, Some graph-theoretical aspects of simple ring-current calculations on conjugated systems, Proc. Roy. Soc. (London) A 341 (1975) 429-449.
56. 60, Nature 325 (1987) 760-761.
57. R.B. Mallion, Personal communication to Professor K. Balasubramanian, Arizona State University, 18 June 1990.
58. R.B. Mallion and D.H. Rouvray, The golden jubilee of the Coulson-Rushbrooke pairing theorem, J. Math. Chem. 5 (1990) 1-21; Postscript to "The golden jubilee of the Coulson-Rushbrooke pairing theorem", J. Math. Chem. 8 (1991) 399-400.
59. R.B. Mallion and D.H. Rouvray, The golden jubilee of the Coulson-Rushbrooke pairing theorem, J. Math. Chem. 5 (1990) 1-21; Postscript to "The golden jubilee of the Coulson-Rushbrooke pairing theorem", J. Math. Chem. 8 (1991) 399-400.
60. 70, Chem. Phys. Lett. 181 (1991) 105-111.
61. B.J. McClelland, Graphical methods for factorising secular determinants of Hückel molecular orbital theory, J. Chem. Soc. Faraday Trans. 2 70 (1974) 1453-1455.
62. 70 molecule, Nature 355 (1992) 622-624.
63. Z. Mihalić and N. Trinajstić, On the number of spanning trees in fullerenes, Fullerene Sci. Technol. 2 (1994) 89-95.
64. B. Mohar, The Laplacian spectrum of graphs, in: Y. Alavi, G. Chartrand, O.R. Ollerman and A.J. Schwenk, eds., Graph Theory, Combinatorics and Applications (Wiley, New York, 1991) 871-898.
65. J.W. Moon, Counting Labelled Trees, Canadian Mathematical Congress Monographs, No. 7 (Canadian Mathematical Congress, Montréal, 1970) 41, 42.
66. J.W. Moon, Some determinant expansions and the matrix-tree theorem, Discrete Math. 124 (1994) 163-171.
67. B. O'Leary and R.B. Mallion, Counting the spanning trees of labelled, planar, molecular-graphs, in: R.B. King and D.H. Rouvray, eds., Graph Theory and Topology in Chemistry. A Collection of Papers Presented at an International Conference Held at the University of Georgia. Athens, GA, USA, 16th-20th March, 1987. Studies in Physical and Theoretical Chemistry (Elsevier, Amsterdam, 1987) 51 (1987) 544-551.
68. B. O'Leary and R.B. Mallion, Counting the spanning trees of labelled, planar, molecular-graphs, in: R.B. King and D.H. Rouvray, eds., Graph Theory and Topology in Chemistry. A Collection of Papers Presented at an International Conference Held at the University of Georgia. Athens, GA, USA, 16th-20th March, 1987. Studies in Physical and Theoretical Chemistry (Elsevier, Amsterdam, 1987) 51 (1987) 544-551.
69. J.B. Orlin, Line-digraphs, arborescences and theorems of Tutte and Knuth, J. Comb. Theory B 25 (1978) 187-198.
70. M.J. Rigby, R.B. Mallion and A.C. Day, Comment on a graph-theoretical description of heteroconjugated molecules, Chem. Phys. Lett. 51 (1977) 178-182 (see also Erratum, idem, ibid. 53 (1978) 418).
71. H. Sachs, Beziehungen zwischen den in einem Graphen enthaltenen Kreisen und seinem charakteristischen Polynom, Publ. Math. Debrecen 11 (1964) 119-134.
72. T. Shibuya and M. Yoshitani, Two icosahedral structures for the C60 cluster, Chem. Phys. Lett. 137 (1987) 13-16.
73. P.W. Stephens, ed., Physics and Chemistry of Fullerenes. A Reprint Collection, Advanced Series in Fullerenes, Vol. I (World Scientific, London, 1993).
74. C. Talbot, The third allotropic fom of carbon: the fullerenes, School Sci. Rev. 75 (1993) 55-64.
75. H.M. Trent, A note on the enumeration and listing of all possible trees in a connected linear graph, Proc. Nat. Acad. Sci. USA 40 (1954) 1004-1007.
76. N. Trinajstić, Z. Mihalić and F.E. Harris, A note on the number of spanning trees in Buckminsterful-lerene, Int. J. Quant. Chem. Quant. Chem. Symp. 28 (1994) 525-528.
77. D.A. Waller, Eigenvalues of graphs and operations, in: T.P. McDonough, and V.C. Mavron, eds., Combinatirics, Proc. British Comb. Conf, 1973, London Math. Soc. Lecture Note Series 13 (Cambridge Univ. Press, London, 1974) 177-183.
78. D.A. Waller, Regular eigenvalues of graphs and enumeration of spanning trees, Proceedings of the Colloquio Internazionale sulle Teori Combinatorie, Roma, 1973, Tomo I (Accademia Nazionale dei Lincei, Rome, 1976), Atti dei Convegni Lincei 17 (1976) 313-320 (in English).
79. D.A. Waller, Regular eigenvalues of graphs and enumeration of spanning trees, Proceedings of the Colloquio Internazionale sulle Teori Combinatorie, Roma, 1973, Tomo I (Accademia Nazionale dei Lincei, Rome, 1976), Atti dei Convegni Lincei 17 (1976) 313-320 (in English).
80. D.A. Waller, General solution to the spanning tree enumeration problem in arbitrary multi-graph joins, IEEE Circuits Systems CAS 23 (1976) 467-469.
81. R.J. Wilson, On the adjacency matrix of a graph, in: D.J.A. Welsh and D.R. Woodall, eds., Combinatorics (Proc. Conf. Comb. Math., Math. Inst., Oxford, 1972) (The Institute of Mathematics and its Applications, Southend-on-Sea, 1973) 295-321.
82. S. Wolfram, Mathematica: a System for Doing Mathematics by Computer (Addison-Wesley, Redwood City, CA, 2nd ed., 1991).