Sharp Upper Bounds on the Clar Number of Fullerene Graphs

• Autorzy: Yang Gao , Heping Zhang
• Języki publikacji: EN

Abstrakty

EN

The Clar number of a fullerene graph with n vertices is bounded above by ⌊n/6⌋ − 2 and this bound has been improved to ⌊n/6⌋ − 3 when n is congruent to 2 modulo 6. We can construct at least one fullerene graph attaining the upper bounds for every even number of vertices n ≥ 20 except n = 22 and n = 30.

Słowa kluczowe

EN

fullerene; Clar number; Clar set; leapfrog transformation

Kategorie tematyczne

• 05C62: Graph representations (geometric and intersection representations, etc.) {For graph drawing, see also }
• 92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
• 05C70: Factorization, matching, partitioning, covering and packing
• 05C10: Planar graphs; geometric and topological aspects of graph theory

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 38
• Numer: 1
• Strony: 155-163

Daty

wydano

2018-02-01

otrzymano

2016-02-12

poprawiono

2016-10-26

zaakceptowano

2016-10-26

online

2017-12-30

Twórcy

autor

Yang Gao

• , , , Gansu , P.R.,

autor

Heping Zhang

• , , , Gansu , P.R.,

Identyfikatory

DOI

10.7151/dmgt.2013