The number of nets of the regular convex polytopes in dimension <= 4
暂无分享,去创建一个
Abstract 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.
[1] N. Biggs. Algebraic Graph Theory: The multiplicative expansion , 1974 .
[2] Michael Doob,et al. Spectra of graphs , 1980 .
[3] Francis Buekenhout,et al. A Theory of Nets for Polyhedra and Polytopes Related to Incidence Geometries , 1997, Des. Codes Cryptogr..
[4] W. Burnside,et al. Theory of Groups of Finite Order , 1909 .