Bounding the largest eigenvalue of signed graphs
type: Item
instance of: scholarly article
title: Bounding the largest eigenvalue of signed graphs
zbMATH Open document ID: 1411.05109
author: Zoran Stanić
published in: Linear Algebra and its Applications
publication date: 2019-05-29T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7060565
zbMATH Keywords: signed graph
zbMATH Keywords: switching equivalence
zbMATH Keywords: adjacency matrix
zbMATH Keywords: index
zbMATH Keywords: upper bound
zbMATH Keywords: net-regular signed graph
MaRDI profile type: Publication
full work available at URL: j.laa.2019.03.011
OpenAlex ID: W2924496266
cites work: Balancing signed graphs
cites work: Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues
cites work: Balancedness and the least eigenvalue of Laplacian of signed graphs
cites work: A new upper bound for the Laplacian spectral radius of graphs
cites work: Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
cites work: On the notion of balance of a signed graph
cites work: Connected signed graphs of fixed order, size, and number of negative edges with maximal index
cites work: Spectral properties of complex unit gain graphs
cites work: Inequalities for Graph Eigenvalues
cites work: Perturbations in a signed graph and its index
cites work: Matrices in the Theory of Signed Simple Graphs
Wikidata QID: Q128180547
DOI: 10.1016/J.LAA.2019.03.011
description: scientific article