Generalized matching networks and their properties

Yang, X., Megson, G.M., Liao, X. and Cao, J. (2007) Generalized matching networks and their properties. International Journal of Parallel, Emergent and Distributed Systems, 22 (3). pp. 185-192. ISSN 1744-5779 doi: 10.1080/17445760601139039

Abstract/Summary

In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cubes and the star graphs. We prove that a GMN on a family of k-connected building graphs is -connected. We then prove that a GMN on a family of Hamiltonian-connected building graphs having at least three vertices each is Hamiltonian-connected. Our conclusions generalize some previously known results.

Item Type	Article
URI	https://reading-clone.eprints-hosting.org/id/eprint/15461
Item Type	Article
Refereed	Yes
Divisions	Science
Uncontrolled Keywords	Interconnection network, Generalized matching network, Recursive generalized matching network, Connectivity, Hamiltonian connectedness
Download/View statistics	View download statistics for this item