Subscribe
Issue No.02 - February (1996 vol.45)
pp: 156-164
ABSTRACT
<p><b>Abstract</b>—Let <it>n</it> be an integer and <it>F</it> = {<it>f</it><sub><it>i</it></sub> : 1 ≤<it>i</it>≤<it>t</it> for some integer <it>t</it>} be a finite set of linear functions. We define a linear congruential graph <it>G</it>(<it>F, n</it>) as a graph on the vertex set <it>V</it> = {0, 1, ..., <it>n</it> - 1}, in which any <it>x</it>∈<it>V</it> is adjacent to <it>f</it><sub><it>i</it></sub>(<it>x</it>) mod n, 1 ≤<it>i</it>≤<it>t</it>. For a linear function <tmath>$\sl g$,</tmath> and a subset <it>V</it><sub>1</sub> of <it>V</it> we define a linear congruential graph <tmath>$G(F,\,\,n,\,\,{\sl g},\,\,V_1)$</tmath> as a graph on vertex set <it>V</it>, in which any <it>x</it>∈<it>V</it> is adjacent to <it>f</it><sub><it>i</it></sub>(<it>x</it>) mod n, 1 ≤<it>i</it>≤<it>t</it> , and any <it>x</it>∈<it>V</it><sub>1</sub> is also adjacent to <tmath>${\sl g}(x)$</tmath> mod n.</p><p>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.</p>
INDEX TERMS
Graph theory, interconnectons networks, network design, parallel processing, computer networks.
CITATION
J. Opatrny, D. Sotteau, N. Srinivasan, K. Thulasiraman, "DCC Linear Congruential Graphs: A New Class of Interconnection Networks", IEEE Transactions on Computers, vol.45, no. 2, pp. 156-164, February 1996, doi:10.1109/12.485369