Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

Authors:
Xie-Bin Chen
Affiliations:
Department of Mathematics and Information Science, Zhangzhou Teachers College, Zhangzhou, Fujian 363000, China
Venue:
Information Processing Letters
Year:
2010

Citing 16
Cited 4

Topological Properties of Hypercubes

IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Graph Theory With Applications

Graph Theory With Applications
Cycles passing through prescribed edges in a hypercube with some faulty edges

Information Processing Letters
Edge-bipancyclicity of a hypercube with faulty vertices and edges

Discrete Applied Mathematics
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges

Information Processing Letters
Path partitions of hypercubes

Information Processing Letters
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

SIAM Journal on Discrete Mathematics
Edge-fault-tolerant bipanconnectivity of hypercubes

Information Sciences: an International Journal
Long paths in hypercubes with conditional node-faults

Information Sciences: an International Journal
Many-to-many disjoint paths in faulty hypercubes

Information Sciences: an International Journal
Long paths in hypercubes with a quadratic number of faults

Information Sciences: an International Journal
Long paths and cycles in hypercubes with faulty vertices

Information Sciences: an International Journal
Hamiltonian paths and cycles passing through a prescribed path in hypercubes

Information Processing Letters
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs

Information Processing Letters
Longest fault-free paths in hypercubes with vertex faults

Information Sciences: an International Journal

A note on cycle embedding in hypercubes with faulty vertices

Information Processing Letters
Paired many-to-many disjoint path covers of hypercubes with faulty edges

Information Processing Letters
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph

Information Sciences: an International Journal
The 2-path-bipanconnectivity of hypercubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let n(=3) be a given integer and @W"k={l|k==2 and |F|==2, and s=h+4 otherwise. Hence, the diameter of the graph Q"n-F is n. Our results improve some previous results.