A note about some properties of BC graphs

Authors:
Xuegong Tan;Shun-Zheng Yu;Jin Han Park
Affiliations:
The College of Chinese Language and Culture, Jinan University, Guangzhou 510631, PR China and School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, PR China;School of Information Science and Technology, Sun Yat-Sen University, Guangzhou 510275, PR China;Division of Mathematical sciences, Pukyong Nation University, Pusan 608-737, Korea
Venue:
Information Processing Letters
Year:
2008

Citing 9
Cited 2

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
A Variation on the Hypercube with Lower Diameter

IEEE Transactions on Computers
Routing properties of supercubes

Information Sciences: an International Journal
The Möbius Cubes

IEEE Transactions on Computers
Maximum number of edges joining vertices on a cube

Information Processing Letters
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
Graph Theory With Applications

Graph Theory With Applications
Optimal Path Embedding in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems

Conditional diagnosability of matching composition networks under the MM* model

Information Sciences: an International Journal
Edge-fault tolerance of hypercube-like networks

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

BC graphs is an important class of hypercube-like interconnection networks. In this paper, some properties-vertex-pancyclicity, super-connectivity and the maximum number of edges joining vertices are studied.