Search Results for ""

A nonassociative algebra obeyed by objects such as the Lie bracket and Poisson bracket. Elements f, g, and h of a Lie algebra satisfy [f,f]=0 (1) [f+g,h]=[f,h]+[g,h], (2) and ...

Two graphs are homeomorphic if there is a graph isomorphism from some graph subdivision of one to some subdivision of the other.

A^n+B^n=sum_(j=0)^(|_n/2_|)(-1)^jn/(n-j)(n-j; j)(AB)^j(A+B)^(n-2j), where |_x_| is the floor function and (n; k) is a binomial coefficient.

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

The Penrose tiles are a pair of shapes that tile the plane only aperiodically (when the markings are constrained to match at borders). These two tiles, illustrated above, are ...