The spanning laceability on the faulty bipartite hypercube-like networks

A w-container C(u,v) of a graph G is a set of w-disjoint paths joining u to v. A w-container of G is a w∗-container if it contains all the nodes of V(G). A bipartite graph G is w∗-laceable if there exists a w∗-container between any two nodes from different parts of G. Let n and k be any two positive...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation 2013-04, Vol.219 (15), p.8095-8103
Main Authors: Lin, Cheng-Kuan, Teng, Yuan-Hsiang, Tan, Jimmy J.M., Hsu, Lih-Hsing, Marušič, Dragan
Format: Article
Language:English
Subjects:
Computation
Faults
Graphs
Hamiltonian
Hamiltonian laceable
Hypercube networks
Hypercube-like network
Integers
Joining
Mathematical models
Networks
Spanning laceability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A w-container C(u,v) of a graph G is a set of w-disjoint paths joining u to v. A w-container of G is a w∗-container if it contains all the nodes of V(G). A bipartite graph G is w∗-laceable if there exists a w∗-container between any two nodes from different parts of G. Let n and k be any two positive integers with n⩾2 and k⩽n. In this paper, we prove that n-dimensional bipartite hypercube-like graphs are f-edge fault k∗-laceable for every f⩽n-2 and f+k⩽n.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2013.02.027