A characteristic polynomial of the Seidel matrix over F3
Abstract
In this paper, we consider the condition when the characteristic polynomials of the Seidel matrix of the graphs are decomposed into products of linear polynomials over F3. We also show the equality over F3 between the characteristic polynomial of the Seidel matrix of a graph and the characteristic polynomial of the adjacency matrix of that graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.