New matrices for the spectral theory of mixed graphs, part I
Abstract
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected) graph with each mixed graph, enabling the spectral analysis of the integrated adjacency matrix to connect the structural properties of the mixed graph and its associated graph. Furthermore, we define certain mixed graph structures and establish their relationships to the eigenvalues of the integrated adjacency matrix.
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.