Fractional decompositions and the smallest-eigenvalue separation (Q2278118)

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.