Search Results for ""

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

The augmented tridiminished icosahedron is Johnson solid J_(64), which is formed from augmentation of the triangular face adjecent to all three hexagons of the tridiminished ...

A piecewise regular function that 1. Has a finite number of finite discontinuities and 2. Has a finite number of extrema can be expanded in a Fourier series which converges ...

A statement which is rigorously not true. Regular two-valued logic allows statements to be only true or false, but fuzzy logic treats "truth" as a continuum which can have a ...

A hexagonal antiprism is an antiprism having hexagons as its bases. A stretched hexagonal antiprism is the convex hull of the tetrahedron 3-compound. The dual polyhedron of ...

A dipyramid having a hexagonal base. The volume of a hexagonal pyramid having a regular hexagon with side length a as a base and of half-height h is therefore V=sqrt(3)a^2h. ...

Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...

Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...