Multiswapped networks and their topological and algorithmic properties

  • Authors:
  • Iain A. Stewart

  • Affiliations:
  • -

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We generalise the biswapped network Bsw(G) to obtain a multiswapped network Msw(H;G), built around two graphs G and H. We show that the network Msw(H;G) lends itself to optoelectronic implementation and examine its topological and algorithmic. We derive the length of a shortest path joining any two vertices in Msw(H;G) and consequently a formula for the diameter. We show that if G has connectivity @k=1 and H has connectivity @l=1 where @l=