Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 86, 2009 - Issue 5
Submit an article Journal homepage
50
Views
16
CrossRef citations to date
0
Altmetric
Section A

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

Jong-Seok Kim Department of Computer Science, Oklahoma State University, Stillwater, OK, USA
,
Eddie Cheng Department of Mathematics and Statistics, Oakland University, Rochester, MI, USACorrespondence[email protected]
,
László Lipták Department of Mathematics and Statistics, Oakland University, Rochester, MI, USA
&
Hyeong-Ok Lee Department of Computer Education, Sunchon National University, Sunchon, Chonnam, South Korea
Pages 771-778 | Received 09 Jan 2007, Accepted 17 Sep 2007, Published online: 23 Apr 2009

Citations (16)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Eddie Cheng, László Lipták, Marc J. Lipman & Matthew Toeniskoetter. (2011) Conditional matching preclusion for the alternating group graphs and split-stars. International Journal of Computer Mathematics 88:6, pages 1120-1136.
Read now

Articles from other publishers (15)

S. Morteza Mirafzal. (2020) Cayley Properties of the Line Graphs Induced by Consecutive Layers of the Hypercube. Bulletin of the Malaysian Mathematical Sciences Society 44:3, pages 1309-1326.
Crossref
Gülnaz Boruzanlı Ek̇inċi & John Baptist Gauci. (2021) The super-connectivity of odd graphs and of their kronecker double cover. RAIRO - Operations Research 55, pages S699-S704.
Crossref
S Morteza Mirafzal. (2019) The automorphism group of the bipartite Kneser graph. Proceedings - Mathematical Sciences 129:3.
Crossref
Jou-Ming Chang, Jinn-Shyong Yang, Shyue-Ming Tang & Kung-Jui Pai. (2018) The Wide Diameters of Regular Hyper-Stars and Folded Hyper-Stars. The Computer Journal 61:1, pages 121-128.
Crossref
Jinn-Shyong Yang, Sih-Syuan Luo & Jou-Ming Chang. (2015) Pruning Longer Branches of Independent Spanning Trees on Folded Hyper-Stars. The Computer Journal 58:11, pages 2972-2981.
Crossref
F. Zhang, K. Qiu & J. S. Kim. (2015) Hyper-star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm. Concurrency and Computation: Practice and Experience 27:16, pages 4186-4193.
Crossref
F. Zhang, K. Qiu & J. S. Kim. 2014. Algorithms and Architectures for Parallel Processing. Algorithms and Architectures for Parallel Processing 526 534 .
László Lipták, Eddie Cheng, Jong-Seok Kim & Sung Won Kim. (2012) One-to-many node-disjoint paths of hyper-star networks. Discrete Applied Mathematics 160:13-14, pages 2006-2014.
Crossref
Jong-Seok Kim, Sung Won Kim, Eddie Cheng & László Lipták. (2011) Topological properties of folded hyper-star networks. The Journal of Supercomputing 59:3, pages 1336-1347.
Crossref
PHILIP BONNEVILLE, EDDIE CHENG & JOSEPH RENZI. (2012) STRONG MATCHING PRECLUSION FOR THE ALTERNATING GROUP GRAPHS AND SPLIT-STARS. Journal of Interconnection Networks 12:04, pages 277-298.
Crossref
Jong-Seok Kim, Hyeong-Ok Lee, Eddie Cheng & László Lipták. (2009) Optimal Independent Spanning Trees on Odd Graphs. The Journal of Supercomputing 56:2, pages 212-225.
Crossref
Jinn‐Shyong Yang & Jou‐Ming Chang. (2010) Independent spanning trees on folded hyper‐stars. Networks 56:4, pages 272-281.
Crossref
Jong-Seok Kim & Hyeong-Ok Lee. (2010) Fault Diameter of Folded Hyper-Star Interconnection Networks FHS(2n,n). The KIPS Transactions:PartA 17A:1, pages 1-8.
Crossref
Jong-Seok Kim, Hyeong-Ok Lee & Sung-Won Kim. (2009) Symmetry and Embedding Algorithm of Interconnection Networks Folded Hyper-Star FHS(2n,n). The KIPS Transactions:PartA 16A:6, pages 501-508.
Crossref
Jong-Seok Kim, Sung-Won Kim & Hyeong-Ok Lee. (2008) Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n). The KIPS Transactions:PartA 15A:6, pages 345-350.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.