Author:
Abiad Aida,De Bruyn Bart,D’haeseleer Jozefien,Koolen Jack H.
Abstract
AbstractA Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue $$-2$$
-
2
.
Funder
Research Foundation Flanders FWO
Reserach Foundation Flanders FWO
National Natural Science Foundation of China
Anhui Initiative of Quantum Information Technologies
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference15 articles.
1. Brouwer A.E., Cohen A.M., Neumaier A.: Distance-regular graphs. Springer-Verlag, Berlin (1989).
2. Cámara M., van Dam E.R., Koolen J.H., Park Y.: Geometric aspects of 2-walk-regular graphs. Linear Algebra and its Applications 439(9), 2692–2710 (2013).
3. Cvetković D.M., Doob M., Sachs H.: Spectra of graphs. Theory and applications. Third edition. Johann Ambrosius Barth Verlag, Heidelberg (1995).
4. Cvetković, D., Rowlinson, P., Simić, S.: An introduction to the theory of graph spectra. London Mathematical Society Student Texts 75. Cambridge University Press, Cambridge, (2010).
5. Dalfó C., Fiol M.A., Garriga E.: On $$k$$-walk-regular graphs. Electron. J. Combin. 16(1), R47 (2009).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献