Search Results for ""

A triangular pyramid is a pyramid having a triangular base. The tetrahedron is a triangular pyramid having congruent equilateral triangles for each of its faces. The edge ...

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 distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

A triangular prism is a prism composed of two triangular bases and three rectangular sides. It is a pentahedron. It is implemented in the Wolfram Language as ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

The triangular distribution is a continuous distribution defined on the range x in [a,b] with probability density function P(x)={(2(x-a))/((b-a)(c-a)) for a<=x<=c; ...

The triangular (or trigonal) dipyramid is one of the convex deltahedra, and Johnson solid J_(12). It is also an isohedron. It is implemented in the Wolfram Language as ...

The triangular inequalities are the inequalities |x-y|<=z<=x+y for real numbers (x,y,z) (Messiah 1962, p. 1056). If these inequalities hold for any one permutation of ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...