Premium
The spectra of wrapped butterfly digraphs
Author(s) -
Comellas Francesc,
Fiol Miquel Angel,
Gimbert Joan,
Mitjana Margarida
Publication year - 2003
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.10085
Subject(s) - eigenvalues and eigenvectors , node (physics) , enhanced data rates for gsm evolution , butterfly , graph , combinatorics , spectrum (functional analysis) , spectral line , computer science , bisection , mathematics , physics , artificial intelligence , geometry , biology , ecology , quantum mechanics , astronomy
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.