Abstract
This paper introduces a generalization of association schemes, for arbitrary finite graphs, even for arbitrary square matrices. This serves several ends: it can help to find eigenvalues, it can decide whether a given graph is the graph of an association scheme, it generalizes the notion of tactical decomposition (in both graphs and designs), and it includes coherent configurations as well.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
