Embedding hypercubes, rings, and odd graphs into hyper-stars

DOI10.1080/00207160701691431zbMath1165.05344OpenAlexW1999717834MaRDI QIDQ3630433

Jong-Seok Kim, Eddie Cheng, Hyeong-Ok Lee, László Lipták

Publication date: 29 May 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a794799791

zbMATH Keywords

hypercubeembeddingtorusodd graphhyper-star

Mathematics Subject Classification ID

Applications of graph theory (05C90) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (6)

The automorphism group of the bipartite Kneser graph ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ Conditional matching preclusion for the alternating group graphs and split-stars ⋮ Cayley properties of the line graphs induced by consecutive layers of the hypercube ⋮ Unnamed Item ⋮ Independent spanning trees on folded hyper-stars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding hypercubes, rings, and odd graphs into hyper-stars