•  
  •  
 

Keywords

algebraic graph theory, eigenvalue, directed graphs

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 D and Y such that there are no arcs from D and Y. For a subclass of Eulerian digraphs, a bound on the size of a separation is obtained in terms of the eigenvalues of the Laplacian matrix. An infinite family of tournaments, namely, the Paley digraphs, where the bound holds with equality, is also given.

abs_vol32_pp291-300.pdf (90 kB)
Abstract in PDF

Share

COinS
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.