Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum

DOI10.1016/j.laa.2018.11.022zbMath1405.05098arXiv1902.02575OpenAlexW2900952421WikidataQ130362369 ScholiaQ130362369MaRDI QIDQ1715835

Ranveer Singh, Naomi Shaked-Monderer, Abraham Berman, Xiao Dong Zhang

Publication date: 29 January 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.02575

zbMATH Keywords

Seidel switchingcomplete multipartite graphsSeidel matrix\(S\)-determined

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (5)

Seidel energy of complete multipartite graphs ⋮ The change of Seidel energy of tripartite Turán graph due to edge deletion ⋮ On signed graphs with at most two eigenvalues unequal to \(\pm 1\) ⋮ The Seidel spectrum of two variants of join operations ⋮ On the Sα-matrix of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A cospectral family of graphs for the normalized Laplacian found by toggling
• Eigenvalues of complete multipartite graphs
• On the Seidel integral complete multipartite graphs
• Seidel integral complete \(r\)-partite graphs
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Enumeration of cospectral graphs.
• Enumeration of Seidel matrices
• Equiangular lines and spherical codes in Euclidean space
• A family of graphs that are determined by their normalized Laplacian spectra
• Two-graphs and NSSDs: an algebraic approach
• Complete multipartite graphs are determined by their distance spectra

This page was built for publication: Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum