English

Some short notes on oriented line graphs and related matrices

Combinatorics 2026-01-06 v3 Discrete Mathematics

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 GG, the eigenvalues of the adjacency matrix of the oriented line graph L(G)\vec{L}(G) of GG are the reciprocals of the poles of the Ihara zeta function of GG. We determine the characteristic polynomial of the zz-Hermitian adjacency matrix of L(G)\vec{L}(G) for each zCz\in \mathbb{C} and dd-regular graph GG with d3d\geq 3. Special cases of this matrix include the Hermitian adjacency matrix of L(G)\vec{L}(G) and the adjacency matrix of the underlying undirected graph of L(G)\vec{L}(G). We also exhibit an application to star coloring of graphs.

Cite

@article{arxiv.2507.13821,
  title  = {Some short notes on oriented line graphs and related matrices},
  author = {Jacob Antony and Cyriac Antony and Jinitha Varughese and Bloomy Joseph},
  journal= {arXiv preprint arXiv:2507.13821},
  year   = {2026}
}

Comments

Comments on version history: v3 is a revised version of v1. Other results in v2 are moved to other works for better organization (various themes therein probably do not belong in the same paper). Corrigendum (v2): The claim in v2 that an NPC result in it was the first NPC result on out-neighborhood injective homomorphisms is not true (results on in-nbd injective homomorphisms exist)

R2 v1 2026-07-01T04:07:34.614Z