Kragujevac J. Math. 28 - 11 Kragujevac J. Math. 28 (2005) 155-164.

BASIC POLYHEDRA IN KNOT THEORY

Slavik V. Jablan1, Ljiljana M. Radovic2, Radmila Sazdanovic3

1The Mathematical Institute, Knez Mihailova 35, P.O. Box 367,
11001 Belgrade, Serbia and Montenegro
(e-mail: jablans@mi.sanu.ac.yu)
2University of Nis, Faculty of Mechanical Engineering, Beogradska 14,
Nis, Serbia and Montenegro
(e-mail: liki@masfak.ni.ac.yu)
3The Mathematical Institute, Knez Mihailova 35, P.O. Box 367,
11001 Belgrade, Serbia and Montenegro
(e-mail: radmilas@gmail.com)

Abstract. Using the table of four-regular 3- and 2-connected planar graphs computed by Brendan McKay, the complete list of basic polyhedra with n £ 16 crossings is derived. For all the basic polyhedra, with the exception of four of them, the number of source links which could be derived from them by adding single digons in their vertices is computed.