Pregled bibliografske jedinice broj: 328542
Computing the bipartite edge frustration of fullerene graphs
Computing the bipartite edge frustration of fullerene graphs // Discrete Applied Mathematics, 155 (2007), 10; 1294-1301 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 328542 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
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
Projekti:
037-0000000-2779 - Diskretna matematika i primjene (Svrtan, Dragutin, MZOS ) ( CroRIS)
177-0000000-0884 - Diskretni matematički modeli u kemiji (Vukičević, Damir, MZOS ) ( CroRIS)
Ustanove:
Građevinski fakultet, Zagreb
Citiraj ovu publikaciju:
Č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
