2018
DOI: 10.1007/s40096-018-0254-4
|View full text |Cite
|
Sign up to set email alerts
|

Constructing signed strongly regular graphs via star complement technique

Abstract: We consider signed graphs, i.e., graphs with positive or negative signs on their edges. The notion of signed strongly regular graph is recently defined by the author (Signed strongly regular graphs, Proceeding of 48th Annual Iranian Mathematical Conference, 2017). We construct some families of signed strongly regular graphs with only two distinct eigenvalues. The construction is based on the well-known method known as star complement technique.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 2 publications
0
10
0
Order By: Relevance
“…The following is a general determination of STE's. The result is independently obtained in [15] and [18]. Recently some problems on the spectrum of signed adjacency matrices have attracted many studies.…”
Section: Introductionmentioning
confidence: 79%
See 2 more Smart Citations
“…The following is a general determination of STE's. The result is independently obtained in [15] and [18]. Recently some problems on the spectrum of signed adjacency matrices have attracted many studies.…”
Section: Introductionmentioning
confidence: 79%
“…The construction problem of STE's is also mentioned there. There are some results on the problem in literature, see [9,14,15,18]. It is known that the only graphs with two distinct eigenvalues of the ordinary adjacency matrix are the complete graphs, which is extensively far from the known results for the signed graphs.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, contrary to [41], the current context does not guarantee that a is integer. Consider the following example, constructed from an equiangular tight frame of 7 vectors in dimension 3, which is closely related to the Fano plane.…”
Section: Two Distinct Eigenvaluesmentioning
confidence: 97%
“…The smallest possible n is n = 10. Ramezani [41] has constructed a signed graph (gains in T 2 ⊂ T 6 ) with the above spectrum on the complement of the Petersen graph. Ramezani moreover shows that this example, illustrated in Figure 2a, is actually a member of an infinite family of signed graphs with two distinct eigenvalues on the triangular graphs 5 ∆(m).…”
Section: The Eisenstein Matrixmentioning
confidence: 99%