Table of Contents
VLSI Design
Volume 2, Issue 4, Pages 335-351
http://dx.doi.org/10.1155/1995/95759

Embeddings into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology

Department of Computer Science, University of North Texas, Denton 76203, TX, USA

Copyright © 1995 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [24 citations]

The following is the list of published articles that have cited the current article.

  • Chi-Hsiang Yeh, and B. Parhami, “Routing and embeddings in cyclic Petersen networks: an efficient extension of the Petersen graph,” Proceedings of the 1999 International Conference on Parallel Processing, pp. 258–265, . View at Publisher · View at Google Scholar
  • Eddie Cheng, Laszlo Liptak, Ke Qiu, Zhizhang Shen, Eddie Cheng, Laszlo Liptak, Ke Qiu, and Zhizhang Shen, “On the Conditional Diagnosability of Cayley Graphs Generated by 2-trees and Related Networks,” 2012 12th International Symposium on Pervasive Systems, Algorithms and Networks, pp. 58–64, . View at Publisher · View at Google Scholar
  • S.R. Ohring, and D.H. Hohndel, “Optimal fault-tolerant communication algorithms on product networks using spanning trees,” Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing, pp. 188–195, . View at Publisher · View at Google Scholar
  • S.R. Ohring, M. Ibel, and S.K. Das, “Reliable broadcasting in product networks in the presence of faulty nodes,” Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing, pp. 711–718, . View at Publisher · View at Google Scholar
  • Sabine Ohring, and Sajal K. Das, “Incomplete hypercubes: Embeddings of tree-related networks,” Journal of Parallel and Distributed Computing, vol. 26, no. 1, pp. 36–47, 1995. View at Publisher · View at Google Scholar
  • Sabine Öhring, and Sajal K. Das, “Folded petersen cube networks: New competitors for the hypercubes,” IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 2, pp. 151–168, 1996. View at Publisher · View at Google Scholar
  • Jung-Sheng Fu, and Gen-Huey Chen, “Hamiltonicity of the hierarchical cubic network,” Theory of Computing Systems, vol. 35, no. 1, pp. 59–79, 2002. View at Publisher · View at Google Scholar
  • Shan-Chyun Ku, Biing-Feng Wang, and Ting-Kai Hung, “Constructing edge-disjoint spanning trees in product networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 213–221, 2003. View at Publisher · View at Google Scholar
  • Jung-Hyun Seo, Hyeong-Ok Lee, and Moon-Suk Jang, “Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks,” The KIPS Transactions:PartA, vol. 15A, no. 4, pp. 189–198, 2008. View at Publisher · View at Google Scholar
  • Sun-Yuan Hsieh, and Yu-Shu Chen, “Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model,” IEEE Transactions on Computers, vol. 57, no. 6, pp. 721–732, 2008. View at Publisher · View at Google Scholar
  • Sun-Yuan Hsieh, and Tsung-Yen Chuang, “The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model,” IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 3, pp. 367–378, 2009. View at Publisher · View at Google Scholar
  • Lin Yang, and Chang-Ming Xing, “An interconnection network RPn(k) and its properties,” 2010 International Conference on Networking and Digital Society, ICNDS 2010, vol. 2, pp. 68–71, 2010. View at Publisher · View at Google Scholar
  • Elias P. Duarte Jr., Luiz C. P. Albini, and Roverli P. Ziwich, “A survey of comparison-based system-level diagnosis,” ACM Computing Surveys, vol. 43, no. 3, 2011. View at Publisher · View at Google Scholar
  • Chia-Wei Lee, and Sun-Yuan Hsieh, “Determining the diagnosability of (1,2)-matching composition networks and its applications,” IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 3, pp. 353–362, 2011. View at Publisher · View at Google Scholar
  • Eddie Cheng, LÁSzlÓ LiptÁK, Ke Qiu, and Zhizhang Shen, “A Unified Approach To The Conditional Diagnosability Of Interconnection Networks,” Journal of Interconnection Networks, vol. 13, no. 03n04, pp. 1250007, 2012. View at Publisher · View at Google Scholar
  • Eddie Cheng, Marc J. Lipman, and László Lipták, “Matching preclusion and conditional matching preclusion for regular interconnection networks,” Discrete Applied Mathematics, vol. 160, no. 13-14, pp. 1936–1954, 2012. View at Publisher · View at Google Scholar
  • Ming-Chien Yang, “Conditional diagnosability of matching composition networks under the MM∗ model,” Information Sciences, vol. 233, pp. 230–243, 2013. View at Publisher · View at Google Scholar
  • Yaping Mao, “Path-connectivity of lexicographic product graphs,” International Journal of Computer Mathematics, pp. 1–13, 2014. View at Publisher · View at Google Scholar
  • Yaping Mao, Fengnan Yanling, Zhao Wang, and Chengfu Ye, “Rainbow vertex-connection and graph products,” International Journal of Computer Mathematics, pp. 1–15, 2015. View at Publisher · View at Google Scholar
  • Yaping Mao, Zhao Wang, Fengnan Yanling, and Chengfu Ye, “Monochromatic connectivity and graph products,” Discrete Mathematics, Algorithms and Applications, pp. 1650011, 2015. View at Publisher · View at Google Scholar
  • Yaping Mao, Zhiwei Guo, Nan Jia, and He Li, “ Linear k -Arboricity in Product Networks ,” Journal of Interconnection Networks, vol. 16, no. 03n04, pp. 1650008, 2016. View at Publisher · View at Google Scholar
  • Yaping Mao, “Constructing edge-disjoint Steiner paths in lexicographic product networks,” Applied Mathematics and Computation, vol. 308, pp. 1–10, 2017. View at Publisher · View at Google Scholar
  • Yaping Mao, Fengnan Yanling, Zhao Wang, and Chengfu Ye, “Proper Connection Number of Graph Products,” Bulletin of the Malaysian Mathematical Sciences Society, 2017. View at Publisher · View at Google Scholar
  • Hua Jiang, and Jiarong Liang, “Intermittent Fault Diagnosability of Hyper Petersen Network,” International Journal of Wireless Information Networks, 2018. View at Publisher · View at Google Scholar