Some short notes on oriented line graphs and related matrices
Abstract
Oriented line graph, introduced by Kotani and Sunada (2000), is closely related to Hashimato's non-backtracking matrix (1989). It is known that for regular graphs G, the eigenvalues of the adjacency matrix of the oriented line graph L(G) of G are the reciprocals of the poles of the Ihara zeta function of G. We determine the characteristic polynomial of the z-Hermitian adjacency matrix of L(G) for each z∈ C and d-regular graph G with d≥ 3. Special cases of this matrix include the Hermitian adjacency matrix of L(G) and the adjacency matrix of the underlying undirected graph of L(G). We also exhibit an application to star coloring of graphs.
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.