Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) (Q2062815)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
scientific article

    Statements

    Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) (English)
    0 references
    0 references
    0 references
    0 references
    3 January 2022
    0 references
    Characterizing the graphs whose eigenvalues are bounded is a classical and interesting problem in spectral graph theory. In this paper, the authors determined the underlying graphs of the mixed graphs with smallest Hermitian eigenvalue greater than \(-\sqrt{3}\). They characterized all mixed graphs on \(n\ge11\) vertices with smallest Hermitian eigenvalue greater than \(-\sqrt{3}\). The mixed graphs on \(n\le10\) vertices with smallest Hermitian eigenvalue greater than \(-\sqrt{3}\) could be obtained easily with the help of a computer because their underlying graphs are determined. Roughly speaking, they completely determined the mixed graphs with smallest Hermitian eigenvalue greater than \(-\sqrt{3}\).
    0 references
    0 references
    0 references
    mixed graph
    0 references
    Hermitian matrix
    0 references
    smallest eigenvalue
    0 references
    0 references