The net-regular strongly regular signed graphs with degree 5
Key Points
Five connected net-regular strongly regular signed graphs exist at degree 3, revealing their structural complexity.
Two strongly regular signed graphs are identified with a net-degree of 1, indicating a broader variety within this classification.
The research focuses on graphs defined by specific degree constraints, contributing to broader graph theory knowledge.
Insight into these graphs may enhance understanding of relationships in network structures and their applications.
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.