Search Results for ""

The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...

The disdyakis triacontahedron is the dual polyhedron of the Archimedean great rhombicosidodecahedron A_2. It is also known as the hexakis icosahedron (Holden 1971, p. 55). It ...

"Conext 21 polyhedron" is the name given here to the solid underlying the soccer ball of the 2020 Tokyo Olympic Games (held in 2021). It is implemented in the Wolfram ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

For a graph G and a subset S^t of the vertex set V(G), denote by N_G^t[S^t] the set of vertices in G which are adjacent to a vertex in S^t. If N_G^t[S^t]=V(G), then S^t is ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...