Title :
Decomposition of Moebius graph networks using sliding sets
Author :
Srimani, Pradip K.
Author_Institution :
Dept. of Comput. Sci., Colorado State Univ., Ft. Collins, CO, USA
Abstract :
The author investigates the different properties of the Moebius graphs by using the concept of sliding sets. The author also computes different decompositions of Moebius graphs into various kinds of sliding sets, providing insight into the rich structure of these graphs. It is shown that any Moebius graph can be decomposed as a vertex disjoint union of sliding sets. The author attempts to generalize the concept of sliding sets and presents some interesting open problems
Keywords :
computer networks; graph theory; set theory; Moebius graph networks; decompositions; open problems; sliding sets; vertex disjoint union; Application software; Codes; Computer architecture; Computer networks; Computer science; Costs; Fault tolerance; Network topology; Upper bound; Very large scale integration;
Conference_Titel :
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN :
0-7803-0050-5
DOI :
10.1109/ISCAS.1991.176569
