2003
DOI: 10.2298/petf0314099s
|View full text |Cite
|
Sign up to set email alerts
|

4-regular integral graphs avoiding ±3 in the spectrum

Abstract: We determine all connected 4-regular integral graphs avoiding ±3 in the spectrum. There are exactly 16 bipartite and 8 nonbipartite such graphs. The smallest bipartite one is K4,4, while the largest has 32 vertices. Among these graphs there are two triplets of cospectral nonisomorphic graphs and two pairs of cospectral nonisomorphic graphs. The smallest nonbipartite one is K5, and the largest has 15 vertices. Among these graphs there is a pair of cospectral nonisomorphic graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
10
0
1

Year Published

2007
2007
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(12 citation statements)
references
References 6 publications
(6 reference statements)
1
10
0
1
Order By: Relevance
“…Similar to the result by Schwenk [20] used in [24] and [25], we have that if G is a QIG, then the bipartite double cover of G is a bipartite QIG. If G is a bipartite QIG then the bipartite double cover consists of two disjoint copies of G. For this reason, we have restricted our search to integral graphs that are bipartite up to this point.…”
Section: Integral Graphs As Quotientssupporting
confidence: 77%
See 1 more Smart Citation
“…Similar to the result by Schwenk [20] used in [24] and [25], we have that if G is a QIG, then the bipartite double cover of G is a bipartite QIG. If G is a bipartite QIG then the bipartite double cover consists of two disjoint copies of G. For this reason, we have restricted our search to integral graphs that are bipartite up to this point.…”
Section: Integral Graphs As Quotientssupporting
confidence: 77%
“…Useful tools include an identity by Hoffman [11] and equations relating the spectral moments to the closed walks of length 6. All QIGs that avoid eigenvalues of ±3 and realize a possible spectrum are found in [24]. Stevanović [23] eliminates spectra using equations arising from graph angles.…”
Section: Introductionmentioning
confidence: 99%
“…Radosavljević and Simić in [19] determined all thirteen nonregular nonbipartite connected integral graphs with maximum degree four. Stevanović [22] determined all connected 4-regular integral graphs avoiding ±3 in the spectrum. A survey of results on integral graphs may be found in [6].…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…In 1970s, Cvetković [2] and Schwenk [12] classified the connected integral graphs of maximum degree at most 3. Stevanović [13] determined the 4-regular integral graphs avoiding ±3 in the spectrum and gave the possible spectrum of 4-regular bipartite graphs. In 2008, Kirkland [10] proved that there are 21 connected Laplacian integral graphs of maximum degree 3 on at least 6 vertices.…”
mentioning
confidence: 99%