Napredna pretraga

Pregled bibliografske jedinice broj: 328523

Fullerene graphs with exponentially many perfect matchings


Došlić, Tomislav
Fullerene graphs with exponentially many perfect matchings // Journal of Mathematical Chemistry, 41 (2007), 2; 183-192 (međunarodna recenzija, članak, znanstveni)


Naslov
Fullerene graphs with exponentially many perfect matchings

Autori
Došlić, Tomislav

Izvornik
Journal of Mathematical Chemistry (0259-9791) 41 (2007), 2; 183-192

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

Ključne riječi
Enumeration; fullerene graph; icosahedral fullerene; perfect matching

Sažetak
We show that for all suffi ciently large even p there is a fullerene graph on p verti- ces that has exponentially many perfect matchings in terms of the number of vertices. Further, we show that all fullerenes with full icosahedral symmetry group have expo- nentially many perfect matchings and indicate how such results could be extended to the fullerenes with lower symmetry.

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA


Projekt / tema
037-0000000-2779 - Diskretna matematika i primjene (Dragutin Svrtan, )
177-0000000-0884 - Diskretni matematički modeli u kemiji (Damir Vukičević, )

Ustanove
Građevinski fakultet, Zagreb

Autor s matičnim brojem:
Tomislav Došlić, (123192)

Časopis indeksira:


  • Current Contents Connect (CCC)
  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus