Signed graphs with least eigenvalue <-2

DOI10.1016/0195-6698(92)90027-WMaRDI QIDQ1193558zbMATH OpenFDO

Authors G. R. Vijayakumar, N. M. Singhi

Publication date 27 September 1992

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0195-6698(92)90027-W

zbMATH Keywords

graph eigenvaluesigned graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

A simple proof is given of the fact that every signed graph with an eigenvalue that is smaller than --2 contains an induced (signed) subgraph whose smallest eigenvalue is equal to --2.

Recommendations

• Signed analogue of line graphs and their smallest eigenvalues
• Publication:3495382
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• scientific article; zbMATH DE number 6004041
• On signed graphs with at most two eigenvalues unequal to \(\pm 1\)

Cites work

• A surprising property of the least eigenvalue of a graph
• Exceptional graphs with smallest eigenvalue -2 and related problems
• scientific article; zbMATH DE number 3204642 (Why is no real title available?)

Cited in

(17)

• On least distance eigenvalue of uniform hypergraphs
• False-twin-free graphs with a fixed number of negative eigenvalues
• Signed complete graphs with exactly \(m\) non-negative eigenvalues
• Extremal spectral results related to spanning trees of signed complete graphs
• Signed graphs whose spectrum is bounded by \(- 2\)
• From finite line graphs to infinite derived signed graphs
• The signed graphs with all but at most three eigenvalues equal to \(-1\)
• Spectral numbers related to signed graphs
• Signed line graphs with least eigenvalue -2: the star complement technique
• scientific article; zbMATH DE number 6004041 (Why is no real title available?)
• scientific article; zbMATH DE number 4168714 (Why is no real title available?)
• scientific article; zbMATH DE number 398956 (Why is no real title available?)
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• A decomposition of signed graphs with two eigenvalues
• Signed analogue of line graphs and their smallest eigenvalues
• Oriented gain graphs, line graphs and eigenvalues
• On eigenvalue multiplicity in signed graphs

This page was built for publication: Signed graphs with least eigenvalue \(<-2\)

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