Name
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. (C) 2003 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1002/net.10085 | NETWORKS |
Keywords | Field | DocType |
butterfly digraph,butterfly network,spectra,eigenvalues | Graph,Combinatorics,Spectral line,Butterfly,Connectivity,Butterfly network,Mathematics,Digraph,Maximum cut,Eigenvalues and eigenvectors | Journal |
Volume | Issue | ISSN |
42 | 1 | 0028-3045 |
Citations | PageRank | References |
2 | 0.39 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francesc Comellas | 1 | 155 | 25.07 |
| Miguel Angel Fiol | 2 | 54 | 11.61 |
| Joan Gimbert | 3 | 46 | 6.62 |
| Margarida Mitjana | 4 | 37 | 7.82 |