On strongly regular signed graphs

DOI10.1016/j.dam.2019.06.017zbMath1428.05331OpenAlexW2955402366MaRDI QIDQ2009017

Zoran Stanić

Publication date: 27 November 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.06.017

zbMATH Keywords

eigenvaluesadjacency matrixblock designnet-degreeregular signed graphwalks in a signed graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (11)

More on signed graphs with at most three eigenvalues ⋮ Signed graphs with at most three eigenvalues ⋮ Signed graphs with two eigenvalues and vertex degree five ⋮ Linear ternary codes of strongly regular signed graphs ⋮ Critical groups of strongly regular graphs and their generalizations ⋮ Signed (0,2)‐graphs with few eigenvalues and a symmetric spectrum ⋮ Signed graphs with three eigenvalues: biregularity and beyond ⋮ On eigenvalue multiplicity in signed graphs ⋮ Some regular signed graphs with only two distinct eigenvalues ⋮ Eigenvalues and critical groups of Adinkras ⋮ Signed graphs whose spectrum is bounded by \(- 2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular graphs. A spectral approach
• Equiangular line systems and switching classes containing regular graphs
• Bounding the largest eigenvalue of signed 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
• On the signed graphs with two distinct eigenvalues
• A Hadamard matrix of order 428

This page was built for publication: On strongly regular signed graphs