Encoding Fullerenes and Geodesic Domes
SIAM Journal on Discrete Mathematics
Kekulé structures and the face independence number of a fullerene
European Journal of Combinatorics
Computing the bipartite edge frustration of fullerene graphs
Discrete Applied Mathematics
On cyclic edge-connectivity of fullerenes
Discrete Applied Mathematics
| Hi-index | 0.00 |
We explore the structure of the maximum vertex independence sets in fullerenes: plane trivalent graphs with pentagonal and hexagonal faces. At the same time, we will consider benzenoids: plane graphs with hexagonal faces and one large outer face. In the case of fullerenes, a maximum vertex independence set may constructed as follows: (i) Pair up the pentagonal faces. (ii) Delete the edges of a shortest path in the dual joining the paired faces to get a bipartite subgraph of the fullerene. (iii) Each of the deleted edges will join two vertices in the same cell of the bipartition; eliminating one endpoint of each of the deleted edges results in two independent subsets.The main part of this paper is devoted to showing that for a properly chosen pairing, the larger of these two independent subsets will be a maximum independent set. We also prove that the construction of a maximum vertex independence set in a benzenoid is similar with the dual paths between pentagonal faces replaced by dual circuits through the outside face. At the end of the paper, we illustrate this method by computing the independence number for each of the icosahedral fullerenes.