Signed graphs with least eigenvalue \(<-2\)
type: Item
instance of: scholarly article
title: Signed graphs with least eigenvalue \(<-2\)
zbMATH Open document ID: 0769.05065
DOI: 10.1016/0195-6698(92)90027-W
author: G. R. Vijayakumar
author: N. M. Singhi
published in: European Journal of Combinatorics
publication date: 1992-09-27T00:00:00Z
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.
reviewed by: Bojan Mohar
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 64847
zbMATH Keywords: graph eigenvalue
zbMATH Keywords: signed graph
MaRDI profile type: Publication
cites work: Exceptional graphs with smallest eigenvalue -2 and related problems
cites work: A surprising property of the least eigenvalue of a graph
cites work: Q5331504
description: scientific article; zbMATH DE number 64847