Fractional decompositions and the smallest-eigenvalue separation (Q2278118): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:33, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fractional decompositions and the smallest-eigenvalue separation |
scientific article |
Statements
Fractional decompositions and the smallest-eigenvalue separation (English)
0 references
9 December 2019
0 references
Summary: A new method is introduced for bounding the separation between the value of \(-k\) and the smallest eigenvalue of a non-bipartite \(k\)-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very short proof of a generalization and strengthening of a recent result of \textit{Z. Qiao} et al. [Electron. J. Comb. 26, No. 2, Research Paper P2.41, 10 p. (2019; Zbl 1416.05096)] about the smallest eigenvalue of non-bipartite distance-regular graphs.
0 references
smallest eigenvalue of non-bipartite distance-regular graphs
0 references
fractional decompositions of graphs
0 references
