Coherent configurations

By D. G. Higman. 1975

Subfields: Algorithms & Complexity, Pure Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

1. B. Douglas
2. R. A. Bailey
3. Peter J. Cameron

In Pure Mathematics

1. B. Douglas
2. R. A. Bailey
3. Peter J. Cameron

Citations in the corpus

• The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, methodology): “For a more thorough background to coherent configurations and their relation to the WL method, see [12, 16, 15, 9].”
• Directed strongly regular graphs obtained from coherent algebras (2004, background): “The basis relations of a coherent algebra give rise to a coherent configuration in the sense of [18].”
• Base size, metric dimension and other invariants of groups and graphs (2011, methodology): “Note that: (1) an association scheme is necessarily a homogenous coherent configuration (see [64]); (2) the coherent configuration arising from a permutation group G is homogenous if and only if G is transitive, and is an association scheme if and only if G is generously transitive (that is, any two”