Search Results for ""

Consider a two-dimensional tessellation with q regular p-gons at each polygon vertex. In the plane, (1-2/p)pi=(2pi)/q (1) 1/p+1/q=1/2, (2) so (p-2)(q-2)=4 (3) (Ball and ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

The regular icosahedron (often simply called "the" icosahedron) is the regular polyhedron and Platonic solid illustrated above having 12 polyhedron vertices, 30 polyhedron ...

The regular dodecahedron, often simply called "the" dodecahedron, is the Platonic solid composed of 20 polyhedron vertices, 30 polyhedron edges, and 12 pentagonal faces, ...

A quasi-regular graph is a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 (Bozóki et al. 2020). ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

A regular skew polyhedron is a polyhedron whose faces and vertex figures are regular skew polygons. There are only three regular skew polyhedra in Euclidean three-space ...

Given a commutative unit ring R, and an R-module M, a sequence {x_1,...,x_n} of elements of R is called a regular sequence for M (or an M-sequence for short), if, for all ...

According to most authors (e.g., Kelley 1955, p. 113; McCarty 1967, p. 144; Willard 1970, p. 92) a regular space is a topological space in which every neighborhood of a point ...

A two-regular graph is a regular graph for which all local degrees are 2. A two-regular graph consists of one or more (disconnected) cycles. The numbers a_n of two-regular ...