Signed graphs whose spectrum is bounded by - 2

DOI10.1016/J.AMC.2022.126991OpenAlexW4213078088MaRDI QIDQ2113716FDOQ2113716

Zoran Stanić, P. Rowlinson

Publication date: 14 March 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.126991

zbMATH Keywords

adjacency matrixstar complementsigned line graphstar partitionfoundation of signed graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Eigenspaces of graphs
• Matrices in the Theory of Signed Simple Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Signed line graphs with least eigenvalue -2: the star complement technique
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• On signed graphs with just two distinct adjacency eigenvalues
• On strongly regular signed graphs
• A decomposition of signed graphs with two eigenvalues
• On eigenvalue multiplicity in signed graphs
• Maximal signed graphs with odd signed cycles as star complements
• Spectra of signed graphs with two eigenvalues
• Notes on exceptional signed graphs

Cited In (3)

• Title not available (Why is that?)
• Some regular signed graphs with only two distinct eigenvalues
• Signed analogue of line graphs and their smallest eigenvalues

This page was built for publication: Signed graphs whose spectrum is bounded by \(- 2\)

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