On strongly regular signed graphs of higher girth
arXiv:2607.12131
The paper classifies strongly regular signed graphs with girth 4 that are bipartite using weighing matrix designs and symmetric block designs, notes that girth‑5 cases are few, and shows that no such graphs exist for higher girth.
Abstract
Strongly regular signed graphs are an extension of strongly regular graphs to the realm of signed graphs, that is, graphs where each edge is positive or negative. Unlike with ordinary strongly regular graphs, most kinds of signed counterparts with girth 4 or higher are describable in terms of known structures. We prove that those with girth 4 that are bipartite are classified by designs of two kinds: weighing matrix designs and symmetric block designs. Those of girth 5 are few and readily described. There are none of higher girth. Those with girth 4 that are not bipartite are unsolved.
6 pp