The net-regular strongly regular signed graphs with degree 6
Qian Yu, Yaoping Hou
TL;DR
This paper classifies all connected 6-regular net-regular strongly regular signed graphs, identifying specific counts for graphs with various net-degrees, advancing understanding of their structure.
Contribution
It provides a complete classification of connected 6-regular net-regular strongly regular signed graphs with explicit enumeration based on net-degree.
Findings
Three graphs with net-degree 4
Six graphs with net-degree 2
Four graphs with net-degree 0
Abstract
In this paper, we study the net-regular strongly regular signed graphs with degree 6 and determine all connected 6-regular and net-regular strongly regular signed graphs. There are three, six and four 6-regular strongly regular signed graphs with net-degree 4, 2 and 0, 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 · Rings, Modules, and Algebras · Graph theory and applications