Loading…
The spectra of wrapped butterfly digraphs
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, bisect...
Saved in:
Published in: | Networks 2003-08, Vol.42 (1), p.15-19 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 0028-3045 1097-0037 |
DOI: | 10.1002/net.10085 |