Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks

摘要

Generalised matching network (GMN) is a newly introduced kind of interconnection network, which generalises hypercube-like network. This paper addresses the fault Hamiltonicity and fault Hamiltonian-connectivity of GMNs. Let G be a GMN with at least four building graphs, each of which is/-fault Hamiltonian-connected and (f+1)-fault Hamiltonian. We prove that if G satisfies two more specified assumptions, then G is (f + 1)-fault Hamiltonian-connected and (f + 2)-fault Hamiltonian.