Spectral Bound for Separations in Eulerian Digraphs

DOI10.13001/1081-3810.3244zbMATH Open1375.05162arXiv1511.03317OpenAlexW2963967099MaRDI QIDQ4594681

Publication date: 24 November 2017

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Abstract: The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph, a separation is a pair of sets of vertices X and Y such that there are no arcs from X and Y . For a subclass of eulerian digraphs, we give an bound on the size of a separation in terms of the eigenvalues of the Laplacian matrix.

Full work available at URL: https://arxiv.org/abs/1511.03317

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

eigenvalue directed graphs algebraic graph theory

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Spectral Bound for Separations in Eulerian Digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594681)