𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The spectra of wrapped butterfly digraphs

✍ Scribed by Francesc Comellas; Miquel Angel Fiol; Joan Gimbert; Margarida Mitjana

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
96 KB
Volume
42
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

The forwarding indices of wrapped butter
The forwarding indices of wrapped butterfly networks
✍ Xinmin Hou; Jun-Ming Xu; Min Xu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 97 KB

## Abstract Let __G__ be a connected graph. A routing in __G__ is a set of fixed paths for all ordered pairs of vertices in __G__. The forwarding index of __G__ is the minimum of the largest number of paths specified by a routing passing through any vertex of __G__ taken over all routings in __G__.

Spectra of digraphs
Spectra of digraphs
✍ Richard A. Brualdi πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 475 KB
Containment of butterflies in networks c
Containment of butterflies in networks constructed by the line digraph operation
✍ Toru Hasunuma; Yukio Shibata πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 484 KB

Let G be a digraph. Let ,5(G) and U(G) denote the line digraph of G and the underlying graph of G, respectively. A network constructed by the line digraph operation means a graph defined by U( L'( G) ) for some digraph G and some integer k, where Lk( G) = L( Lk-' (G)). Let S(G) be the minimum degree