Search Results for ""

A pentagon is a five-sided polygon. Several special types of pentagons are illustrated above. In particular, a pentagon with vertices equally spaced around a circle and with ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...

A dipyramid, also called a bipyramid, consists of two pyramids symmetrically placed base-to-base. The dipyramids are duals of the regular prisms. Their skeletons are the ...

If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.

The 57-cell, also called the pentacontaheptachoron, is a regular self-dual locally projective polytope with 57 hemidodecahedral facets described by Coxeter (1982) and also ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...