Search arXivSearch

arXiv · 2606.10312

On the Spectra of Digraph Laplacians

Abstract

We present several Laplacian-type matrices associated with a loopless digraph $D$: the out-/in-degree Laplacians $\mathcal L_{\mathrm{out}},\mathcal L_{\mathrm{in}}$, the incidence Laplacian $\mathcal L_{\mathrm{inc}}=BB^{\mathsf T}$, and the symmetrized and skew-symmetrized variants $\mathcal S_{\mathrm{out}},\mathcal K_{\mathrm{out}}$. We show that $\mathcal L_{\mathrm{inc}}(D)$ coincides with the Laplacian of the underlying undirected multigraph, and we derive spectral and characteristic-polynomial relations under arc reversal and complementation (including a simplification for Eulerian digraphs for $\mathcal S_{\mathrm{out}}$). We demonstrate that the spectral radius of $\mathcal L_{\mathrm{out}}$ is bounded above by the order of the digraph and give a characterization in the equality case. We further obtain explicit formulas for joins and line digraphs, giving a general determinantal identity relating the out-degree Laplacian characteristic polynomials of a regular digraph and its line digraph.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Saieed Akbari, Michael Cavers, Farzad Maghsoudi, Babak Miraftab. 2026-06-10. On the Spectra of Digraph Laplacians. https://arxiv.org/abs/2606.10312

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO