engleski

On Two Graffiti Conjectures about Fullerene Graphs

We use recently obtained lower bounds on the independence number of fullerene graphs to settle in affirmative a conjecture of the {; ; \em Graffiti}; ; software about the relationship between the independence number and the face independence number of a fullerene graph. We also consider another {; ; \em Graffiti}; ; conjecture, concerned with the relationship of the independence number and the radius of a fullerene graph, and show that it is not valid.

fullerene graph; face independence number; Graffiti; conjecture

nije evidentirano