Naslov
On lower bounds of number of perfect matchings in fullerene graphs

Autori
Došlić, Tomislav

Izvornik
Journal of mathematical chemistry (0259-9791) 24 (1998), 4; 359-364

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
perfect matchings ; lower bounds ; fullerene graphs

Sažetak
Couting perfect matchings in graphs is a very difficult problem. Some recently developed decomposition techniques allowed us to estimate the lower bound of the number of perfect matchings in certain classes of graphs. By applying these techniques, it will be shown that every fullerene graph with p vertices contains at least p/2+1 perfect matchings. It is a significant improvement over a previously published estimate, which claimed at least three perfect matchings in every fullerene graph. As an interesting chemical consequence, it is noted that every bisubstituted derivative of a fullerene still permits a Kekule structure.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA