Backtracking to compute the closed-shell independence number of a fullerene

Match

Volumn 58, Issue 2, 2007, Pages 385-401

  Daugherty, Sean ^a   Myrvold, Wendy ^a   Fowled, Patrick W ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34548623315     PISSN: 03406253     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (19)

1. I. Bomze, M. Budinich, P. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 4. Boston, MA: Kluwer Academic Publishers, 1999.
2. G. Brinkmann and A. W. M. Dress. A constructive enumeration of fullerenes. Journal of Algorithms, 23:345-358, 1997.
3. G. Brinkmann and A. W. M. Dress. Penthex puzzles: a reliable and efficient top-down approach to fullerene-structure enumeration. Advances in Applied Mathematics, 21:473-480, 1998.
4. V. Chvátal. Determining the stability number of a graph. SIAM Journal on Computing, 6:643-602, 1977.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. Cambridge, MA: MIT Press, 2nd edition, 2001.
6. 26. Fullerene Science and Technology, 7:427-435, 1999.
7. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs: Theory and Application. New York: Academic Press, 1980.
8. S. Fajtlowicz and C. E. Larson. Graph-theoretic independence as a predictor of fullerene stability. Chemical Physics Letters, 377:485-490, 2003.
9. P. W. Fowler, S. Daugherty, and W. Myrvold. Independence number and fullerene stability. Preprint, 19 pages, 2007.
10. 24 as a chemical illustration of graph theoretical independence. Journal of the Chemical Society, Perkin Tramactions 2, pages 1531-1534, 1998.
11. P. W. Fowler and D. E. Manolopoulos. An Atlas of Fullerenes. Oxford: Clarendon Press, 1995.
12. P. W. Fowler and W. Myrvold. Some chemical applications of independent sets. In P. Hansen, N. Mladenovic, J. A. M. Perez, B. M. Batista, and J. M. Moreno-Vega, editors, Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search, Tenerife, Spain, 2005.
13. P. W. Fowler, K. M. Rogers, K. R. Somers, and A. Troisi. Independent sets and the prediction of additional patterns for higher fullerenes. Journal of the Chemical Society, Perkin Transactions 2, pages 2023-2027, 1999.
14. J. E. Graver. The independence number of fullerenes and benzenoids. European Journal of Combinatorics, 27:850-863, 2006.
15. D. S. Johnson and M. A. Trick, editors. Cliques, Colouring, and Satisfiability, Second DIMACS Implementation Challenge, Oct. 11-1.8, 1993, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS, 1996.
16. W. Myrvold and P. W. Fowler. Fast enumeration of all independent sets of a graph. Preprint, 10 pages, 2005.
17. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7:425-440, 1986.
18. D. H. Rouvray. Chapter 7. In A. T. Balaban, editor, Chemical Applications of Graph Theory. London: Academic Press, 1976.
19. A. Streitwieser, Jr. Molecular Orbital Theory for Organic Chemists. New York: John Wiley & Sons, 1961.