Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648637 | Discrete Mathematics | 2011 | 4 Pages |
Abstract
It is shown that every generalized fullerene graph GG with 13 pentagons is 2-extendable, a brick, and cyclically 5-edge-connected, i.e., that GG cannot be separated into two components, each containing a cycle, by deletion of fewer than five edges. New lower bound on the number of perfect matchings in such graphs are also established.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Shengzhang Ren,