SPIRAL CODING OF LEAPFROG POLYHEDRA

Authors
BRINKMANN G FOWLER PW
Citation
G. Brinkmann et Pw. Fowler, SPIRAL CODING OF LEAPFROG POLYHEDRA, Journal of chemical information and computer sciences, 38(3), 1998, pp. 463-468
Citations number
23
Categorie Soggetti
Computer Science Interdisciplinary Applications","Computer Science Information Systems","Computer Science Interdisciplinary Applications",Chemistry,"Computer Science Information Systems
Journal title
Journal of chemical information and computer sciences → ACNP
ISSN journal
00952338
Volume
38
Issue
3
Year of publication
1998
Pages
463 - 468
Database
ISI
SICI code
0095-2338(1998)38:3<463:SCOLP>2.0.ZU;2-O
Abstract
Statistical connections are made between the constructibility of a cub ic polyhedron by leapfrog transformation (omnicapping + dualization of a planar graph) and its representability by face-spiral coding. It is proved that all truncations of cubic polyhedra with more than four ve rtices are nonspiral. More qualitatively, several million examples sho w leapfrogs from cubic polyhedral parents to be less likely to have sp irals than their parents. Exhaustive search shows that the smallest fu llerene polyhedron without a spiral, whatever it may turn out to be, h as, more than 176 and not more than 380 vertices and is not a leapfrog .