The net-regular strongly regular signed graphs with degree 5
Qian Yu, Yaoping Hou
TL;DR
This paper classifies all connected net-regular strongly regular signed graphs with degree 5, extending the understanding of their structure and enumeration.
Contribution
It provides a complete classification of connected net-regular strongly regular signed graphs with degree 5, including specific counts for degrees 3 and 1.
Findings
Five strongly regular signed graphs with net-degree 3
Two strongly regular signed graphs with net-degree 1
Complete enumeration of such graphs with degree 5
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · graph theory and CDMA systems