Napredna pretraga

Pregled bibliografske jedinice broj: 328542

Computing the bipartite edge frustration of fullerene graphs


Došlić, Tomislav; Vukičević, Damir
Computing the bipartite edge frustration of fullerene graphs // Discrete Applied Mathematics, 155 (2007), 10; 1294-1301 (međunarodna recenzija, članak, znanstveni)


Naslov
Computing the bipartite edge frustration of fullerene graphs

Autori
Došlić, Tomislav ; Vukičević, Damir

Izvornik
Discrete Applied Mathematics (0166-218X) 155 (2007), 10; 1294-1301

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

Ključne riječi
PR Bipartite edge frustration; Fullerene graph; Icosahedral fullerene; Fullerene stability; Bipartite spanning subgraph

Sažetak
Bipartite edge frustration of a graph is defi ned as the smallest number of edges that have to be deleted from the graph to obtain a bipartite spanning subgraph. We show that for fullerene graphs this quantity can be computed in polynomial time and obtain explicit formulas for the icosahedral fullerenes. We also report some computational results and discuss a potential application of this invariant in the context of fullerene stability.

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

Č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