Search Results for ""

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

The Krackhardt kite is the simple graph on 10 nodes and 18 edges illustrated above. It arises in social network theory. It is implemented in the Wolfram Language as ...

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

A magic tesseract is a four-dimensional generalization of the two-dimensional magic square and the three-dimensional magic cube. A magic tesseract has magic constant ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

An isohedron is a convex polyhedron with symmetries acting transitively on its faces with respect to the center of gravity. Every isohedron has an even number of faces ...

The pentagonal hexecontahedron is the 60-faced dual polyhedron of the snub dodecahedron A_8 (Holden 1971, p. 55). It is Wenninger dual W_(18). A tetrahedron 10-compound, cube ...

A square pyramid is a pyramid with a square base. It is a pentahedron. The lateral edge length e and slant height s of a right square pyramid of side length a and height h ...

There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...