Search Results for ""

The dihedral group D_n is the symmetry group of an n-sided regular polygon for n>1. The group order of D_n is 2n. Dihedral groups D_n are non-Abelian permutation groups for ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

Euler's 6n+1 theorem states that every prime of the form 6n+1, (i.e., 7, 13, 19, 31, 37, 43, 61, 67, ..., which are also the primes of the form 3n+1; OEIS A002476) can be ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...

Given a function f(x), its inverse f^(-1)(x) is defined by f(f^(-1)(x))=f^(-1)(f(x))=x. (1) Therefore, f(x) and f^(-1)(x) are reflections about the line y=x. In the Wolfram ...

The Lucas central triangle (a term coined here for the first time) is the triangle DeltaL_AL_BL_C formed by the centers of the Lucas circles of a given reference triangle ...

The five Mathieu groups M_(11), M_(12), M_(22), M_(23), and M_(24) were the first sporadic groups discovered, having been found in 1861 and 1873 by Mathieu. Frobenius showed ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...