Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
type: Item
instance of: scholarly article
title: Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
zbMATH Open document ID: 1485.05103
author: Junying Lu
author: Lu Lu
author: Weijun Liu
published in: Linear Algebra and its Applications
publication date: 2022-01-03T00:00:00Z
review text: 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}\).
reviewed by: Xiaogang Liu
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 7451377
zbMATH Keywords: mixed graph
zbMATH Keywords: Hermitian matrix
zbMATH Keywords: smallest eigenvalue
MaRDI profile type: Publication
full work available at URL: j.laa.2021.11.009
OpenAlex ID: W3214983437
cites work: The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
cites work: Q4739937
cites work: Graphs with least eigenvalue \(-2\): ten years on
cites work: Q4828550
cites work: Q2716030
cites work: Large regular bipartite graphs with median eigenvalue 1
cites work: Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
cites work: Q4050734
cites work: On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
cites work: On graphs with the smallest eigenvalue at least −1 − √2, part III
cites work: Hermitian-adjacency matrices and Hermitian energies of mixed graphs
cites work: On a property of the class of n-colorable graphs
cites work: Q5661547
cites work: On graphs with the smallest eigenvalue at least −1 − √2, part I
cites work: On graphs with the smallest eigenvalue at least −1 − √2, Part II
cites work: On graphs whose orientations are determined by their Hermitian spectra
cites work: On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
cites work: On mixed graphs whose Hermitian spectral radii are at most 2
DOI: 10.1016/J.LAA.2021.11.009
description: scientific article; zbMATH DE number 7451377