Edge-pancyclicity and path-embeddability of bijective connection graphs
From MaRDI portal
Publication:2466094
DOI10.1016/j.ins.2007.08.012zbMath1128.68075OpenAlexW2070979416WikidataQ60402664 ScholiaQ60402664MaRDI QIDQ2466094
Publication date: 11 January 2008
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.08.012
dilationpathgraph embeddingedge-pancyclicitycrossed cubecrossed cubesMöbius cubeparallel computing systembijective connection graphMöbius cubesBC graphs
Related Items (38)
On the \(t/k\)-diagnosability of BC networks ⋮ Two node-disjoint paths in balanced hypercubes ⋮ Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions ⋮ Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model ⋮ The strong local diagnosability of a hypercube network with missing edges ⋮ Constructing the nearly shortest path in crossed cubes ⋮ THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK ⋮ Adaptive Diagnosis of Hamiltonian Networks under the Comparison Model ⋮ Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction ⋮ Geodesic pancyclicity of twisted cubes ⋮ On pancyclicity properties of OTIS-mesh ⋮ The spined cube: a new hypercube variant with smaller diameter ⋮ Cycles Embedding in Exchanged Crossed Cube ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ A fast fault-identification algorithm for bijective connection graphs using the PMC model ⋮ Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model ⋮ Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph ⋮ Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes ⋮ Hamiltonian properties of honeycomb meshes ⋮ Reliability analysis of bijective connection networks in terms of the extra edge-connectivity ⋮ A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ THE CONNECTIVITY OF EXCHANGED HYPERCUBES ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Efficient unicast in bijective connection networks with the restricted faulty node set ⋮ Embedding meshes into twisted-cubes ⋮ An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Embedding of tori and grids into twisted cubes ⋮ Edge-fault-tolerant node-pancyclicity of twisted cubes ⋮ Embedding meshes into locally twisted cubes ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ Long paths in hypercubes with conditional node-faults ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Two-round diagnosability measures for multiprocessor systems ⋮ Independent spanning trees in crossed cubes
Cites Work
- Unnamed Item
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Fault-tolerant cycle-embedding of crossed cubes
- Edge-pancyclicity of Möbius cubes
- Paths in Möbius cubes and crossed cubes
- On rank vs. communication complexity
- The congestion of \(n\)-cube layout on a rectangular grid
- Complete path embeddings in crossed cubes
- Lower bounds on communication complexity in distributed computer networks
- Embedding graphs onto the Supercube
- The Mobius cubes
- Embedding binary trees into crossed cubes
- Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
This page was built for publication: Edge-pancyclicity and path-embeddability of bijective connection graphs
