Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Data-Driven Control Scheme for Linear Arrays: Application to a Stable Insertion Sorter
IEEE Transactions on Parallel and Distributed Systems
Edge Congestion and Topological Properties of Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
The congestion of n-cube layout on a rectangular grid
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Fast Sorting Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
IEEE Transactions on Parallel and Distributed Systems
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
IEEE Transactions on Computers
Embedding Binary Trees into Crossed Cubes
IEEE Transactions on Computers
On Balancing Sorting on a Linear Array
IEEE Transactions on Parallel and Distributed Systems
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Fault-tolerant cycle-emebedding of crossed cubes
Information Processing Letters
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
SIAM Journal on Computing
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Paths in Möbius cubes and crossed cubes
Information Processing Letters
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Information Processing Letters
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Constructing the nearly shortest path in crossed cubes
Information Sciences: an International Journal
Edge-fault-tolerant node-pancyclicity of twisted cubes
Information Processing Letters
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Embedding of tori and grids into twisted cubes
Theoretical Computer Science
On pancyclicity properties of OTIS-mesh
Information Processing Letters
Efficient unicast in bijective connection networks with the restricted faulty node set
Information Sciences: an International Journal
The spined cube: A new hypercube variant with smaller diameter
Information Processing Letters
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Theoretical Computer Science
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Geodesic pancyclicity of twisted cubes
Information Sciences: an International Journal
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Hamiltonian properties of honeycomb meshes
Information Sciences: an International Journal
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
| Hi-index | 0.08 |
An n-dimensional Bijective Connection graph (in brief BC graph) is a regular graph with 2^n nodes and n2^n^-^1 edges. The n-dimensional hypercube, crossed cube, Mobius cube, etc. are some examples of the n-dimensional BC graphs. In this paper, we propose a general method to study the edge-pancyclicity and path-embeddability of the BC graphs. First, we prove that a path of length l with dist(X"n,x,y)+2=y in X"n, where X"n (n=4) is a n-dimensional BC graph satisfying the three specific conditions and V(X"n) is the node set of X"n. Furthermore, by this result, we can claim that X"n is edge-pancyclic. Lastly, we show that these results can be applied to not only crossed cubes and Mobius cubes, but also other BC graphs except crossed cubes and Mobius cubes. So far, the research on edge-pancyclicity and path-embeddability has been limited in some specific interconnection architectures such as crossed cubes, Mobius cubes.