Berman, A., Shaked-Monderer, N., Singh, R. and Zhang, X. (2019) Complete Multipartite Graphs That Are Determined, up to Switching, by Their Seidel Spectrum. Linear Algebra and its Applications, 564, 58-71.
https://doi.org/10.1016/j.laa.2018.11.022

has been cited by the following article:

• TITLE: The Seidel Eigenvalues Polynomial and Spectrum of the Petersen Graph

  AUTHORS: Dan Zhou, Shengmei Lv

  KEYWORDS: Petersen Graph, Seidel Eigenvalues Polynomial, Seidel Spectral, Seidel Integral Graph

  JOURNAL NAME: Open Journal of Applied Sciences, Vol.15 No.4, April 18, 2025

  ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the identity matrix. The Seidel eigenvalues polynomial of the graph G is S G ( λ )=det( λI−S( G ) ) . If all the Seidel eigenvalues of the graph G are integers, then G is called a Seidel integer graph. In this paper, we apply methods from algebraic and matrix theory to obtain the Seidel eigenvalue polynomials of the Petersen graph. Furthermore, we determine whether the Petersen graph is a Seidel integral graph.