Pages that link to "Item:Q2458708"
From MaRDI portal
The following pages link to Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes (Q2458708):
Displayed 26 items.
- Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes (Q266936) (← links)
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees (Q456645) (← links)
- Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults (Q497687) (← links)
- Cycles embedding in folded hypercubes with conditionally faulty vertices (Q507576) (← links)
- Cycles embedding in folded hypercubes under the conditional fault model (Q526816) (← links)
- Fault-tolerant Hamiltonian laceability of balanced hypercubes (Q528717) (← links)
- On reliability of the folded hypercubes in terms of the extra edge-connectivity (Q726366) (← links)
- Fault-free cycles in folded hypercubes with more faulty elements (Q975467) (← links)
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes (Q991233) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- On \(g\)-extra conditional diagnosability of hypercubes and folded hypercubes (Q1680535) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\) (Q1989359) (← links)
- Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
- Cycles in folded hypercubes with two adjacent faulty vertices (Q2330100) (← links)
- Characterizing which powers of hypercubes and folded hypercubes are divisor graphs (Q2344018) (← links)
- Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant (Q2346376) (← links)
- Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs (Q2389847) (← links)
- Cycles embedding on folded hypercubes with faulty nodes (Q2446879) (← links)
- Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices (Q2656951) (← links)
- Distinguishing graphs via cycles (Q2695304) (← links)
- Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults (Q2798312) (← links)
- A note on embeddings among folded hypercubes, even graphs and odd graphs (Q2995486) (← links)
- (Q5164959) (← links)
- Vertex-fault-tolerant cycles embedding on enhanced hypercube networks (Q5890607) (← links)
- Link fault tolerance of BC networks and folded hypercubes on \(h\)-extra \(r\)-component edge-connectivity (Q6068192) (← links)