A note on embeddings among folded hypercubes, even graphs and odd graphs

DOI10.1080/00207160903501925zbMath1226.05181OpenAlexW1988404475WikidataQ114101697 ScholiaQ114101697MaRDI QIDQ2995486

László 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

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

Cites Work

• Unnamed Item
• On reliability of the folded hypercubes
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• A note on cycle embedding in folded hypercubes with faulty elements
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• On conditional diagnosability of the folded hypercubes
• Cycles in folded hypercubes
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• Some edge‐fault‐tolerant properties of the folded hypercube

This page was built for publication: A note on embeddings among folded hypercubes, even graphs and odd graphs