Finding Fullerene Patches in Polynomial Time

Details Finding Fullerene Patches in Polynomial Time Finding Fullerene Patches in Polynomial Time

2009-07-15

arxiv.org/abs/0907.2627v1

Computer Science

Discrete Mathematics

Scientific paper

We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-boundary vertices have degree 3, and boundary vertices have degree 2 or 3. The degree sequence along the boundary is called the boundary code of G. We show that the question whether a given sequence S is a boundary code of some fullerene patch can be answered in polynomial time when such patches have at most five 5-faces. We conjecture that our algorithm gives the correct answer for any number of 5-faces, and sketch how to extend the algorithm to the problem of counting the number of different patches with a given boundary code.

Affiliated with

Also associated with

No associations

Rating

Finding Fullerene Patches in Polynomial Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding Fullerene Patches in Polynomial Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Fullerene Patches in Polynomial Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364828