Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
From MaRDI portal
Publication:2458708
DOI10.1016/j.camwa.2006.10.033zbMath1149.68409MaRDI QIDQ2458708
Publication date: 2 November 2007
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2006.10.033
bipartite graphs; folded hypercubes; Hypercubes; Hamiltonian-connectivity; strongly Hamiltonian-laceability
68R10: Graph theory (including graph drawing) in computer science
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, Vertex-fault-tolerant cycles embedding on enhanced hypercube networks, Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity, Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes, Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults, Cycles embedding in folded hypercubes with conditionally faulty vertices, Cycles embedding in folded hypercubes under the conditional fault model, Fault-tolerant Hamiltonian laceability of balanced hypercubes, On reliability of the folded hypercubes in terms of the extra edge-connectivity, Fault-free cycles in folded hypercubes with more faulty elements, Pancyclicity and bipancyclicity of conditional faulty folded hypercubes, Survey on path and cycle embedding in some networks, On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes, The Hamiltonian connectivity of rectangular supergrid graphs, Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\), Hamiltonian paths in hypercubes with local traps, Cycles in folded hypercubes with two adjacent faulty vertices, Characterizing which powers of hypercubes and folded hypercubes are divisor graphs, Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant, Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs, Cycles embedding on folded hypercubes with faulty nodes, Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices, Distinguishing graphs via cycles, Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults, A note on embeddings among folded hypercubes, even graphs and odd graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Hamiltonian-laceability of star graphs
- The twisted N-cube with application to multiprocessing
