Edge Sums Of De Bruijn Interconnection Networks (Q4449513)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2040300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge Sums Of De Bruijn Interconnection Networks |
scientific article; zbMATH DE number 2040300 |
Statements
Edge Sums Of De Bruijn Interconnection Networks (English)
0 references
11 February 2004
0 references
de Bruijn digraph
0 references
de Bruijn graph
0 references
0.922581136226654
0 references
0.922581136226654
0 references
0.7529960870742798
0 references
Let every vertex of a graph \(G\) have an integer value and let to every edge of \(G\) be assigned the sum of the two vertices it joins (so-called edge sum). The authors characterize the set of edge sums for de Bruijn graphs, what can be usefull in interconnection networks.
0 references