On regular signed graphs with three eigenvalues

DOI10.7151/dmgt.2279zbMath1433.05139OpenAlexW2998669250WikidataQ126429350 ScholiaQ126429350MaRDI QIDQ2295995

Milica Anđelić, Zoran Stanić, Tamara Koledin

Publication date: 17 February 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2279

zbMATH Keywords

eigenvalueadjacency matrixblock designsigned line graphregular signed graph

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (4)

More on signed graphs with at most three eigenvalues ⋮ Signed graphs with at most three eigenvalues ⋮ Signed graphs with integral net Laplacian spectrum ⋮ Signed graphs with three eigenvalues: biregularity and beyond

Cites Work

• Unnamed Item
• Regular graphs. A spectral approach
• Feasibility conditions for the existence of walk-regular graphs
• Spectral conditions for the reconstructibility of a graph
• Perturbations in a signed graph and its index
• Regular graphs with four eigenvalues
• Spectra of signed graphs with two eigenvalues
• On the Laplacian coefficients of signed graphs
• Equiangular line systems and switching classes containing regular graphs
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)]
• Matrices in the Theory of Signed Simple Graphs
• On signed graphs with two distinct eigenvalues
• More on graphs with just three distinct eigenvalues
• Integral regular net-balanced signed graphs with vertex degree at most four

This page was built for publication: On regular signed graphs with three eigenvalues