Signed analogue of line graphs and their smallest eigenvalues

DOI10.1002/JGT.22699MaRDI QIDQ6056785zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi

Publication date 4 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.05578

zbMATH Keywords

Hoffman graphline graphroot systemsigned graphsmallest eigenvalue

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Abstract: In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than $-2$ and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The proof is based on what we call Hoffman's limit theorem which we formulate for Hermitian matrices, and also the extension of the concept of Hoffman graph and line graph for the setting of signed graphs.

Recommendations

• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• Signed graphs with least eigenvalue \(<-2\)
• scientific article; zbMATH DE number 6004041
• Signed graphs whose spectrum is bounded by \(- 2\)
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)

Cites work

• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• scientific article; zbMATH DE number 1820648 (Why is no real title available?)
• Line graphs, root systems, and elliptic geometry
• Matrix theory
• Notes on exceptional signed graphs
• On fat Hoffman graphs with smallest eigenvalue at least -3
• On graphs whose least eigenvalue exceeds -1-2
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• On graphs with smallest eigenvalue at least \(-3\) and their lattices
• On products and line graphs of signed graphs, their eigenvalues and energy
• On signed graphs and gramians
• On the Laplacian coefficients of signed graphs
• Open problems in the spectral theory of signed graphs
• Signed graphs
• Signed graphs represented by \(D_{\infty}\)
• Spectra of graphs
• The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding

Cited in

(5)

• Signed graphs with least eigenvalue \(<-2\)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Maximal digraphs whose Hermitian spectral radius is at most 2
• Uniquely derived generalized line graphs and uniquely represented signed graphs with least eigenvalues \(\geq -2\)
• On signed graphs whose spectral radius does not exceed \(\sqrt{2 + \sqrt{5}}\)

This page was built for publication: Signed analogue of line graphs and their smallest eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056785)