Enumeration of Irreducible Contact Graphs on the Sphere

In this article, using the computer, we enumerate all locally-rigid packings by N congruent circles (spherical caps) on the unit sphere S 2 with N < 12. This is equivalent to the enumeration of irreducible spherical contact graphs.

Saved in:
Bibliographic Details
Published inJournal of mathematical sciences (New York, N.Y.) Vol. 203; no. 6; pp. 837 - 850
Main Authors Musin, O. R., Tarasov, A. S.
Format Journal Article
LanguageEnglish
Published Boston Springer US 09.12.2014
Springer
Subjects
Mathematics
Mathematics and Statistics
Planar Graph
Linear Inequality
Contact Graph
Spherical Triangle
Information Transmission Problem
Online AccessGet full text

Cover

More Information
Summary:In this article, using the computer, we enumerate all locally-rigid packings by N congruent circles (spherical caps) on the unit sphere S 2 with N < 12. This is equivalent to the enumeration of irreducible spherical contact graphs.
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-014-2174-7