Analysis of the modified even networks
S.V.R. Madabhushi, S. Lakshmivarahan, Sudarshan Dhall · 2002
The authors introduce a class of networks based on G/sup delta / graphs that are subgraphs of the binary hypercubes and even networks. For this class of networks, the authors present (a) complete characterization of the node disjoint (parallel) paths, (b) a strategy for tracing a Hamiltonian cycle in G/sup delta /, and (c) an optimal algorithm for single source broadcast of data packets using a greedy spanning tree.>