Search Results for ""

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...

While the above figure appears to be a sequence of nested squares, it actually consists of a single square spiral.

A curve which can be turned continuously inside an equilateral triangle. There are an infinite number of delta curves, but the simplest are the circle and lens-shaped ...

A diagonal of a square matrix which is traversed in the "southeast" direction. "The" diagonal (or "main diagonal," or "principal diagonal," or "leading diagonal") of an n×n ...

The diameter of a circle is the distance from a point on the circle to a point pi radians away, and is the maximum distance from one point on a circle to another. The ...

An equilateral polyhedron is a polyhedron whose edges are all of equal length. Platonic solids, Archimedean solids, canonical antiprisms, and canonical prisms, Johnson ...

A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.

A smooth curve which corresponds to the limiting case of a histogram computed for a frequency distribution of a continuous distribution as the number of data points becomes ...