Edge-pancyclicity and path-embeddability of bijective connection graphs
From MaRDI portal
Publication:2466094
DOI10.1016/j.ins.2007.08.012zbMath1128.68075WikidataQ60402664 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
dilation; path; graph embedding; edge-pancyclicity; crossed cube; crossed cubes; Möbius cube; parallel computing system; bijective connection graph; Möbius cubes; BC graphs
68R10: Graph theory (including graph drawing) in computer science
Related Items
Adaptive Diagnosis of Hamiltonian Networks under the Comparison Model, Fault-Tolerant Panconnectivity of Augmented Cubes AQn, Independent spanning trees in crossed cubes, Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity, 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, Geodesic pancyclicity of twisted cubes, A fast fault-identification algorithm for bijective connection graphs using the PMC model, 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, 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 of tori and grids into twisted cubes, Two-round diagnosability measures for multiprocessor systems, Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model, Complete binary trees embeddings in Möbius cubes, Embedding a family of disjoint multi-dimensional meshes into a crossed cube, Edge-fault-tolerant node-pancyclicity of twisted cubes, Embedding meshes into locally twisted cubes, Long paths in hypercubes with conditional node-faults, Embedding a family of disjoint 3D meshes into a crossed cube, The strong local diagnosability of a hypercube network with missing edges, On pancyclicity properties of OTIS-mesh, The spined cube: a new hypercube variant with smaller diameter, Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes, Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges, Constructing the nearly shortest path in crossed cubes, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes, Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model, Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph, THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK, Cycles Embedding in Exchanged Crossed Cube, THE CONNECTIVITY OF EXCHANGED HYPERCUBES, Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
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
