Search Results for ""

An algebra with no nontrivial nilpotent ideals. In the 1890s, Cartan, Frobenius, and Molien independently proved that any finite-dimensional semisimple algebra over the real ...

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

The shoelace formula, also known as Gauss's area formula, the shoelace algorithm, shoelace method, or surveyor's formula, is a name sometimes given to the polygon area ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

The de Grey-Haugstrup graphs are two 6-chromatic graphs on 47 and 48 vertices that are unit-distance in 3 dimensions (de Grey and Haugstrup 2020).

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...