Generalized matching networks and their properties

Authors:
Xiaofan Yang;Graham M. Megson;Xiaofeng Liao;Jianqiu Cao
Affiliations:
School of Computer and Information, Chongqing Jiaotong University, Chongqing, P. R. China,College of Computer Science, Chongqing University, Chongqing, P. R. China;Department of Computer Science, School of Systems Engineering, University of Reading, Reading, Berkshire, UK;College of Computer Science, Chongqing University, Chongqing, P. R. China;School of Computer and Information, Chongqing Jiaotong University, Chongqing, P. R. China
Venue:
International Journal of Parallel, Emergent and Distributed Systems
Year:
2007

Citing 13
Cited 1

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry

Journal of Parallel and Distributed Computing
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
The Möbius Cubes

IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation

IEEE Transactions on Parallel and Distributed Systems
Super-connectivity and super-edge-connectivity for some interconnection networks

Applied Mathematics and Computation
Hamiltonian properties on the class of hypercube-like networks

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
The t/k-Diagnosability of the BC Graphs

IEEE Transactions on Computers
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks

Information Processing Letters
Graph Theory With Applications

Graph Theory With Applications
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Minimum neighborhood in a generalized cube

Information Processing Letters
The diagnosability of the matching composition network under the comparison diagnosis model

IEEE Transactions on Computers

Fault diagnosability of arrangement graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 [image omitted] -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.