Edge Sums Of De Bruijn Interconnection Networks

From MaRDI portal
Publication:4449513





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.











This page was built for publication: Edge Sums Of De Bruijn Interconnection Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449513)