A note on embeddings among folded hypercubes, even graphs and odd graphs
DOI10.1080/00207160903501925zbMATH Open1226.05181OpenAlexW1988404475WikidataQ114101697 ScholiaQ114101697MaRDI QIDQ2995486FDOQ2995486
L. Lipták, Hyeong-Ok Lee, Eddie Cheng, Jong-Seok Kim
Publication date: 21 April 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160903501925
Recommendations
Applications of graph theory (05C90) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)
Cites Work
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Cycles in folded hypercubes
- Title not available (Why is that?)
- Some edge‐fault‐tolerant properties of the folded hypercube
- 1-vertex-fault-tolerant cycles embedding on folded hypercubes
- A note on cycle embedding in folded hypercubes with faulty elements
- On reliability of the folded hypercubes
- On conditional diagnosability of the folded hypercubes
- w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
Cited In (1)
This page was built for publication: A note on embeddings among folded hypercubes, even graphs and odd graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995486)