Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
Abstract
A weighing matrix W is quasi-balanced if |W||W|=|W||W| has at most two off-diagonal entries, where |W|ij=|Wij|. A quasi-balanced weighing matrix W signs a strongly regular graph if |W| coincides with its adjacency matrix. Among other things, signed strongly regular graphs and their equivalent association schemes are presented.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.