Some Combinatorial Properties of Fullerene Graphs

Please enable javascript in your browser.

Ghaderi, Shadisadat | 2012

1401 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 49643 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Mahmoodian, Abadolla
Abstract:
In the study of molecules and chemical structures, especially fullerenes, they can be modeled to graphs. In this way, we can consider some chemical properties as graphical properties such as, perfect matching, connectivity, Hamiltonian; in order to obtain some results about some families of chemical structures.In this thesis, at first we mention some graphical and combinatorial properties. Then,we survey some results about fullerenes, and finally we investigate some properties of specific families of fullerenes. Furthermore, we mention some existing open problems in each case
Keywords:
Fullerene Graph ; Perfect Matching ; Independence Number ; Nanotubes Properties ; Hamiltonian Cycle Problem