Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Computing the bipartite edge frustration of fullerene graphs (CROSBI ID 137908)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Došlić, Tomislav ; Vukičević, Damir Computing the bipartite edge frustration of fullerene graphs // Discrete applied mathematics, 155 (2007), 10; 1294-1301

Podaci o odgovornosti

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

engleski

Computing the bipartite edge frustration of fullerene graphs

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.

PR Bipartite edge frustration; Fullerene graph; Icosahedral fullerene; Fullerene stability; Bipartite spanning subgraph

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

155 (10)

2007.

1294-1301

objavljeno

0166-218X

Povezanost rada

Matematika

Indeksiranost