Find link

language:

Find link is a tool written by Edward Betts.

searching for Graph automorphism 3 found (17 total)

List of finite simple groups (1,789 words) [view diff] exact match in snippet view article find links to article

B1(q) also exists, but is the same as A1(q). B2(q) has a non-trivial graph automorphism when q is a power of 2. This group is obtained from the symplectic

Reductive group (8,018 words) [view diff] exact match in snippet view article find links to article

k ¯ {\displaystyle {\overline {k}}} -point of a maximal torus), a graph automorphism (corresponding to an automorphism of the Dynkin diagram), and a field

Network motif (10,370 words) [view diff] exact match in snippet view article find links to article

though, there is no efficient (or polynomial time) algorithm for the graph automorphism problem, this problem can be tackled efficiently in practice by McKay's