Name
Abstract | ||
|---|---|---|
Orthogonal graphs are natural extensions of the classical binary and b-ary hypercubes b=2/sup l/ and are abstractions of interconnection schemes used for conflict-free orthogonal memory access in multiprocessor design. Based on the type of connection mode, these graphs are classified into two categories: those with disjoint and those with nondisjoint sets of modes. The former class coincides with the class of b-ary b=2/sup l/ hypercubes, and the latter denotes a new class of interconnection. It is shown that orthogonal graphs are Cayley graphs, a certain subgroup of the symmetric (permutation) group. Consequently these graphs are vertex symmetric, but it turns out that they are not edge symmetric. For an interesting subclass of orthogonal graphs with minimally nondisjoint set of modes, the shortest path routing algorithm and an enumeration of node disjoint (parallel) paths are provided. It is shown that while the number of node disjoint paths is equal to the degree, the distribution is not uniform with respect to Hamming distance as in the binary hypercube. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/12.223683 | Computers, IEEE Transactions |
Keywords | Field | DocType |
conflict-free orthogonal memory access,node disjoint,orthogonal graph,sup l,orthogonal graphs,vertex symmetric,new class,former class,binary hypercube,node disjoint path,b-ary hypercubes,shortest path,graph theory | Graph theory,Combinatorics,Indifference graph,Chordal graph,Floyd–Warshall algorithm,Cograph,Pathwidth,Longest path problem,1-planar graph,Mathematics,Distributed computing | Journal |
Volume | Issue | ISSN |
42 | 5 | 0018-9340 |
Citations | PageRank | References |
3 | 1.33 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. V. R. Madabhushi | 1 | 3 | 1.33 |
| S. Lakshmivarahan | 2 | 412 | 66.03 |
| Dhall | 3 | 271 | 80.48 |