Abstract
The knowledge of the spectrum of a (di)graph is relevant for estimating some of its structural properties, which provide information on the topological and communication properties of the corresponding networks. Among these properties, we have, for instance, edge-expansion and node-expansion, bisection width, diameter, maximum cut, connectivity, and partitions. In this paper, we determine the complete spectra (eigenvalues and multiplicities) of wrapped butterfly digraphs. © 2003 Wiley Periodicals, Inc.
Author supplied keywords
Cite
CITATION STYLE
Comellas, F., Angel Fiol, M., Gimbert, J., & Mitjana, M. (2003). The Spectra of Wrapped Butterfly Digraphs. Networks, 42(1), 15–19. https://doi.org/10.1002/net.10085
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.