Fault-tolerant multiprocessor and VLSI-based system communication architectures
Fault-tolerant computing: theory and techniques; Vol. 2
Strategies for interconnection networks: some methods from graph theory
Journal of Parallel and Distributed Computing
Generalized de Bruijn digraphs
Networks
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
The connection machine
Connectivity of consecutive-d digraphs
Discrete Applied Mathematics - Special double volume: interconnection networks
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
IEEE Transactions on Computers
Graph Theory With Applications
Graph Theory With Applications
Filtering Random Graphs to Synthesize Interconnection Networks with Multiple Objectives
IEEE Transactions on Parallel and Distributed Systems
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
| Hi-index | 14.98 |
Let n be an integer and F = {fi : 1 驴i驴t for some integer t} be a finite set of linear functions. We define a linear congruential graph G(F, n) as a graph on the vertex set V = {0, 1, ..., n - 1}, in which any x驴V is adjacent to fi(x) mod n, 1 驴i驴t. For a linear function $\sl g$, and a subset V1 of V we define a linear congruential graph $G(F,\,\,n,\,\,{\sl g},\,\,V_1)$ as a graph on vertex set V, in which any x驴V is adjacent to fi(x) mod n, 1 驴i驴t , and any x驴V1 is also adjacent to ${\sl g}(x)$ mod n.These graphs generalize several well known families of graphs, e.g., the de Bruijn graphs. We give a family of linear functions, called DCC linear functions, that generate regular, highly connected graphs which are of substantially larger order than de Bruijn graphs of the same degree and diameter. Some theoretical and empirical properties of these graphs are given and their structural properties are studied.