Affordable Access

Publisher Website

Packing resonant hexagons in fullerenes

Authors
Journal
Discrete Optimization
1572-5286
Publisher
Elsevier
Volume
13
Identifiers
DOI: 10.1016/j.disopt.2014.05.002
Keywords
  • Clar Number
  • Fullerene
  • Resonant Set

Abstract

Abstract A fullerene graph G is a plane cubic graph such that every face is bounded by either a hexagon or a pentagon. A set H of disjoint hexagons of G is a resonant set (or sextet pattern) if G−V(H) has a perfect matching. A resonant set is a forcing set if G−V(H) has a unique perfect matching. The size of a maximum resonant set is called the Clar number of G. In this paper, we show the Clar number of fullerene graphs with a non-trivial cyclic 5-edge-cut is (n−20)/10. Combining a previous result obtained in Kardoš et al. (2009), it is proved in this paper that a fullerene has the Clar number at least (n−380)/61. For leapfrog fullerenes, we show that the Clar number is at least n/6−n/5. Further, it is shown that the minimum forcing resonant set has at least two hexagons and the bound is tight.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Packing and molecular shape: layers of centred hex...

on Acta Crystallographica Section... April 2005
More articles like this..