The number of nets of the regular convex polytopes in dimension≤4

被引：34

作者：

Buekenhout, F ^{[1
]}

Parker, M ^{[1
]}

机构：

[1] Free Univ Brussels, Dept Math, B-1050 Brussels, Belgium

来源：

DISCRETE MATHEMATICS | 1998年 / 186卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(97)00225-2

中图分类号：

O1 [数学];

学科分类号：

0701 [数学]; 070101 [基础数学];

摘要：

Classifying the nets (also called unfoldings or developments or patterns) of the regular convex polytopes under the isometry group of the polytope is equivalent to classifying the spanning trees of the facet-adjacency graph under its automorphism group. This is done for all such polytopes of dimension at most 4. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：69 / 94

页数：26

共 12 条

[1]

ALEXANDROW AD, 1958, KONVEXE POLYEDER

[2]

Biggs N., 1974, ALGEBRAIC GRAPH THEO

[3]

A Theory of Nets for Polyhedra and Polytopes Related to Incidence Geometries [J].

Bouzette S. ;

Buekenhout F. ;

Dony E. ;

Gottcheiner A. .

Designs, Codes and Cryptography, 1997, 10 (2) :115-136

[4]

BOUZETTE S, UNPUB REGULAR DODECA

[5]

BROUWER A, 1994, COMMUNICATION

[6]

Brouwer A. M., 1989, Results in Mathematics and Related Areas, DOI 10.1007/978-3-642-74341-2

[7]

Burnside W., 1911, Theory of groups of finite order, V2nd

[8]

BUSET D, 1984, MITT MATH SEM GIESS

[9]

Coxeter H. S. M., 1973, REGULAR POLYTOPES

[10]

Cvetkovic D. M., 1980, Spectra of Graphs-Theory and Application

← 1 2 →