The non-bipartite graphs with all but two eigenvalues in [–1, 1] (Q2961486): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/03081087.2016.1194802 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2440398804 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial designs with two singular values. I: Uniform multiplicative designs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The graphs with all but two eigenvalues equal to \(\pm 1\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On graphs with exactly one eigenvalue less than -1 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The second largest eigenvalue of a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spectra of graphs / rank | |||
Normal rank | |||
Latest revision as of 10:40, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The non-bipartite graphs with all but two eigenvalues in [–1, 1] |
scientific article |
Statements
The non-bipartite graphs with all but two eigenvalues in [–1, 1] (English)
0 references
20 February 2017
0 references
graph eigenvalue
0 references
forbidden subgraph
0 references
