2000 character limit reached
Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
Published 3 Feb 2022 in math.CO | (2202.01369v1)
Abstract: A weighing matrix $W$ is quasi-balanced if $|W||W|\top=|W|\top|W|$ has at most two off-diagonal entries, where $|W|{ij}=|W{ij}|$. 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.