The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
From MaRDI portal
Publication:5864392
DOI10.2298/FIL1918919YzbMath1499.05406OpenAlexW3003112214WikidataQ126304015 ScholiaQ126304015MaRDI QIDQ5864392
No author found.
Publication date: 7 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1918919y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the third largest eigenvalue of graphs
- Biregular graphs with three eigenvalues
- On graphs with just three distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- Spectral characterizations of almost complete graphs
- A characterization of graphs with rank 5
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- A characterization of graphs with rank 4
- On graphs with exactly one eigenvalue less than -1
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On the construction of graphs of nullity one
- On graphs with three eigenvalues
- Small regular graphs with four eigenvalues
- Combinatorial designs with two singular values. II: Partial geometric designs
- A nonregular analogue of conference graphs
- Regular graphs with four eigenvalues
- The graphs with all but two eigenvalues equal to \(\pm 1\)
- The graphs with all but two eigenvalues equal to \(-2\) or 0
- L-fuzzy sets
- Separability properties of almost-disjoint families of sets
- The non-bipartite graphs with all but two eigenvalues in [–1, 1]
- On the nullity of graphs
- A characterization of singular graphs
- Graphs with many valencies and few eigenvalues
- GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
This page was built for publication: The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
