This monograph identifies polytopes that are "combinatorially R1-embeddable", within interesting lists of polytopal graphs, i.e. such that corresponding polytopes are either prominent mathematically (regular partitions, root lattices, uniform polytopes and so on), or applicable in chemistry (fullerenes, polycycles, etc.). The embeddability, if any, provides applications to chemical graphs and, in the first case, it gives new combinatorial perspective to "R2-prominent" affine polytopal objects. The lists of polytopal graphs in the book come from broad areas of geometry, crystallography and graph theory. The book concentrates on such concise and, as much as possible, independent definitions. The scale-isometric embeddability ?the main unifying question, to which those lists are subjected ?is presented with the minimum of technicalities.

1.Introduction:Graps and their Scale-isometric Embedding 2.An Example:Embedding of Fullerenes 3.Regular Tilings and Honeycombs 4.Semi-regular Polyhedra and Relatives of Prisms and Antiprisms 5.Truncation,Capping and Chamfering 6.92 Regular-faced (not Semi-regular)Polyhedra 7.Semi-regular and Regular-faced n-polytopes,n≥4 8.Polycycles and Other Chemically Relevant Graphs 9.Plane Tilings 10.Uniform Partitions of 3-space and Relatives 11.Lattices,Bi-lattices and Tiles 12.Small Polyhedra 13.Bifaced Polyhedra 14.Special graphs 15.Some Generalization of embedding

등록된 사용후기

사용후기 쓰기 새 창 더보기

사용후기가 없습니다.

등록된 상품문의

상품문의 쓰기새 창 더보기

상품문의가 없습니다.

배송정보

교환/반품 정보