Search Results for ""

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...

A square matrix A is a normal matrix if [A,A^(H)]=AA^(H)-A^(H)A=0, where [a,b] is the commutator and A^(H) denotes the conjugate transpose. For example, the matrix [i 0; 0 ...

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...

The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge ...

When a number is expressed in scientific notation, the number of significant digits (or significant figures) is the number of digits needed to express the number to within ...