2000 character limit reached
The net-regular strongly regular signed graphs with degree 5
Published 31 Jul 2025 in math.CO | (2507.23420v1)
Abstract: In this paper, we determine all connected net-regular strongly regular signed graphs with degree 5. There are five and two strongly regular signed graphs with net-degree 3 and 1, respectively.
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.