Search Results for ""

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 ...

Define a = d(u,v)d(w,x) (1) b = d(u,w)d(v,x) (2) c = d(u,x)d(v,w), (3) where u, v, w, and x are vertices of a graph and d(i,j) is the graph distance between vertices i and j. ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

A class formed by sets in R^n which have essentially the same structure, regardless of size, shape and dimension. The "essential structure" is what a set keeps when it is ...

A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...

Ede (1958) enumerates 13 basic series of stellations of the rhombic triacontahedron, the total number of which is extremely large. Pawley (1973) gave a set of restrictions ...

A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...

The solid angle Omega subtended by a surface S is defined as the surface area Omega of a unit sphere covered by the surface's projection onto the sphere. This can be written ...

A number of attractive tetrahedron 10-compounds can be constructed. The first (left figures) can be obtained by combining tetrahedron 5-compounds of opposite chirality ...