1995
DOI: 10.1016/0024-3795(94)00346-f
|View full text |Cite
|
Sign up to set email alerts
|

Regular graphs with four eigenvalues

Abstract: General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.-Users may download and print one copy of any publication from the public portal for the purpose of private study or research-You may not further distribute the material or use it for any profit-making activity or commercia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
100
0
2

Year Published

1999
1999
2020
2020

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 97 publications
(103 citation statements)
references
References 14 publications
1
100
0
2
Order By: Relevance
“…For results on nonregular graphs with three adjacency eigenvalues, we refer the reader to [1,3,5,16]. Regular graphs with four adjacency (Laplacian) eigenvalues were studied in [6,10], and nonregular bipartite graphs with four adjacency eigenvalues were investigated in [8,9], through the study of the incidence graphs of some combinatorial designs.…”
Section: For Any I the Degree Of V I That Is The Number Of Edges mentioning
confidence: 99%
See 1 more Smart Citation
“…For results on nonregular graphs with three adjacency eigenvalues, we refer the reader to [1,3,5,16]. Regular graphs with four adjacency (Laplacian) eigenvalues were studied in [6,10], and nonregular bipartite graphs with four adjacency eigenvalues were investigated in [8,9], through the study of the incidence graphs of some combinatorial designs.…”
Section: For Any I the Degree Of V I That Is The Number Of Edges mentioning
confidence: 99%
“…With an easy calculation, we obtain that D 1 and D 2 have the Laplacian spectra 0 [1] , 2 [6] , 5 [7] , 9 [1] and 0 [1] , 3 [6] , 6 [7] , 10 [1] , respectively.…”
Section: Examplementioning
confidence: 99%
“…We mention that Φ 0 (G) has been studied in [6] to characterize a family of graphs with specified eigenvalues. Combining Corollary 1 and Lemma 1, we obtain the following result.…”
Section: Theorem 1 [10 Theorem 1]mentioning
confidence: 99%
“…The connected non-regular graphs with three distinct eigenvalues have been studied by, for example, De Caen, Van Dam & Spence [7], Bridges & Mena [1], Muzychuk & Klin [13], Van Dam [17] and Cheng, Gavrilyuk, Greaves & Koolen [6]. The connected regular graphs with four distinct eigenvalues were studied by Van Dam [18], Van Dam & Spence [19] and Huang & Huang [12], among others. Cioabă, Haemers, Vermette & Wong [4] (resp.…”
Section: Introductionmentioning
confidence: 99%