Search Results for ""

A functional graph is a directed graph in which each vertex has outdegree one, and can therefore be specified by a function mapping {1,...,n} onto itself. Functional graphs ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

The graph difference of graphs G and H is the graph with adjacency matrix given by the difference of adjacency matrices of G and H. A graph difference is defined when the ...

The greatest dividing exponent gde(n,b) of a base b with respect to a number n is the largest integer value of k such that b^k|n, where b^k<=n. It is implemented as the ...

The Harada-Norton group is the sporadic group HN of order |HN| = 273030912000000 (1) = 2^(14)·3^6·5^6·7·11·19. (2) It is implemented in the Wolfram Language as ...

The Held group is the sporadic group He of order |He| = 4030387200 (1) = 2^(10)·3^3·5^2·7^3·17. (2) It is implemented in the Wolfram Language as HeldGroupHe[].

The Higman-Sims group is the sporadic group HS of order |HS| = 44352000 (1) = 2^9·3^2·5^3·7·11. (2) The Higman-Sims group is 2-transitive, and has permutation representations ...

A number of attractive 10-compounds of the regular icosahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 11-compounds of the regular icosahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 2-compounds of the regular icosahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...