Title :
A note on orthogonal graphs
Author :
Madabhushi, S.V.R. ; Lakshmivarahan, S. ; Dhall, S.K.
Author_Institution :
Parallel Process. Inst., Oklahoma Univ., Norman, OK, USA
fDate :
30 Apr-2 May 1991
Abstract :
The authors present a complete characterization of the shortest paths and node disjoint (parallel) paths between any two nodes in an interesting class of graphs called orthogonal graphs with minimum nondisjoint set of modes. It is also shown that this class of graphs does not possess many of the (topological) symmetry properties exhibited by the binary hypercube
Keywords :
graph theory; multiprocessor interconnection networks; minimum nondisjoint; node disjoint parallel paths; nodes; orthogonal graphs; shortest paths; Bandwidth; Computer science; Hardware; Hypercubes; Memory architecture; Multidimensional systems; Signal analysis; Testing; Topology; Tree graphs;
Conference_Titel :
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location :
Anaheim, CA
Print_ISBN :
0-8186-9167-0
DOI :
10.1109/IPPS.1991.153815
