Mixed graphs with smallest eigenvalue greater than -sqrt{3}

Abstract

In this paper, we determine the underlying graphs of the mixed graphs with smallest Hermitian eigenvalue greater than -\sqrt{3}. Furthermore, we characterize all mixed graphs on n\ge 11 vertices with smallest Hermitian eigenvalue greater than -\sqrt{3}. The mixed graphs on n\le 10 vertices with smallest Hermitian eigenvalue greater than -\sqrt{3} could be also obtained easily with the help of computer because their underlying graphs are determined. Roughly speaking, we completely determine the mixed graphs with smallest Hermitian eigenvalue greater than -\sqrt{3}.

Publication
In Linear Algebra and Its Applications
Click the Cite button above to demo the feature to enable visitors to import publication metadata into their reference management software.
Create your slides in Markdown - click the Slides button to check out the example.

Supplementary notes can be added here, including code, math, and images.

Lu Lu(鲁卢)
Lu Lu(鲁卢)
Associate Professor, PhD Supervisor

My research interests include algebraic graph theory, spectral graph theory and group theory.