Spectral bound for separations in Eulerian digraphs
Combinatorics
2015-11-12 v1
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.
Cite
@article{arxiv.1511.03317,
title = {Spectral bound for separations in Eulerian digraphs},
author = {Krystal Guo},
journal= {arXiv preprint arXiv:1511.03317},
year = {2015}
}
Comments
14 pages