Search Results for ""
81 - 90 of 963 for Regular OctahdronSearch Results
![](/common/images/search/spacer.gif)
The n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...
A polyhedron or plane tessellation is called semiregular if its faces are all regular polygons and its corners are alike (Walsh 1972; Coxeter 1973, pp. 4 and 58; Holden 1991, ...
A regular surface M subset R^n is called orientable if each tangent space M_p has a complex structure J_p:M_p->M_p such that p->J_p is a continuous function.
A right pyramid is a pyramid for which the apex lies directly above the centroid of the base. A regular pyramid is therefore a special case of a right pyramid.
z(1-z)(d^2y)/(dz^2)+[c-(a+b+1)z](dy)/(dz)-aby=0. It has regular singular points at 0, 1, and infty. Every second-order ordinary differential equation with at most three ...
A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts. The symbol {p} denotes a regular polygon for integer ...
A tetrahedral ring is a term given in this work to a set of n regular tetrahedra joined face-to-face sharing a common edge (with internal conjoined faces removed). These ...
The Kepler-Poinsot polyhedra are four regular polyhedra which, unlike the Platonic solids, contain intersecting facial planes. In addition, two of the four Kepler-Poinsot ...
The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...
The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...
![](/common/images/search/spacer.gif)
...