279
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes

&
Pages 1281-1298 | Received 19 Nov 2014, Accepted 28 May 2015, Published online: 06 Aug 2015

References

  • A. Angjeli, E. Cheng, and L. Lipták, Linearly many faults in augmented cubes, Int. J. Parallel Emergent Distrib. Syst. 28(5) (2013), pp. 475–483. doi: 10.1080/17445760.2012.735234
  • Y. Ashir, I.A. Stewart, and A. Ahmed, Communication algorithms in k-ary n-cube interconnection networks, Inform. Process. Lett. 61(1) (1997), pp. 43–48. doi: 10.1016/S0020-0190(96)00188-3
  • N.-W. Chang and S.-Y. Hsieh, Conditional diagnosability of augmented cubes under the PMC model, IEEE Trans. Dependable Secure Comput. 9(1) (2012), pp. 46–60. doi: 10.1109/TDSC.2010.59
  • Y.-C. Chen and J.J.M. Tan, Restricted connectivity for three families of interconnection networks, Appl. Math. Comput. 188(2) (2007), pp. 1848–1855. doi: 10.1016/j.amc.2006.11.085
  • E. Cheng, R. Jia, and D. Lu, Matching preclusion and conditional matching preclusion for augmented cubes, J. Interconnect. Netw. 11(1–2) (2010), pp. 35–60. doi: 10.1142/S0219265910002726
  • E. Cheng, K. Qiu, and Z. Shen, On the surface area of the augmented cubes, J. Supercomput. 61(3) (2012), pp. 856–868. doi: 10.1007/s11227-011-0641-1
  • E. Cheng, S. Shah, V. Shah, and D.E. Steffy, Strong matching preclusion for augmented cubes, Theor. Comput. Sci. 491(17) (2013), pp. 71–77. doi: 10.1016/j.tcs.2013.05.002
  • S.A. Choudum and V. Sunitha, Augmented cubes, Networks 40(2) (2002), pp. 71–84. doi: 10.1002/net.10033
  • P. Cull and S.M. Larson, The Möbius cubes, IEEE Trans. Comput. 44(5) (1995), pp. 647–659. doi: 10.1109/12.381950
  • W.J. Dally, Performance analysis of k-ary n-cube interconnection networks, IEEE Trans. Comput. 39(6) (1990), pp. 775–785. doi: 10.1109/12.53599
  • W.J. Dally and C.L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Trans. Comput. 36(5) (1987), pp. 547–553. doi: 10.1109/TC.1987.1676939
  • K. Efe, A variation on the hypercube with lower diameter, IEEE Trans. Comput. 40(11) (1991), pp. 1312–1316. doi: 10.1109/12.102840
  • A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes, IEEE Trans. Parallel Distrib. Syst. 2(3) (1991), pp. 31–42. doi: 10.1109/71.80187
  • A.-H. Esfahanian, Generalized measures of fault tolerance with application to N-cube networks, IEEE Trans. Comput. 38(11) (1989), pp. 1586–1591. doi: 10.1109/12.42131
  • A.-H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform. Process. Lett. 27(4) (1988), pp. 195–199. doi: 10.1016/0020-0190(88)90025-7
  • A.-H. Esfahanian, L.M. Ni, and B.E. Sagan, The twisted n-cube with application to multiprocessing, IEEE Trans. Comput. 40(1) (1991), pp. 88–93. doi: 10.1109/12.67323
  • Y.-M. Fan, J.-M. Xu, and M. Lü, The restricted edge-connectivity of Kautz undirected graphs, Ars Combin. 81(4) (2006), pp. 369–379.
  • L. Guo, C. Qin, and X. Guo, Super connectivity of Kronecker products of graphs, Inform. Process. Lett. 110(16) (2010), pp. 659–661. doi: 10.1016/j.ipl.2010.05.013
  • P.A.J. Hilbers, R.J.M. Koopman, and J.L.A. VandeSnepscheut, The twisted cube, in Proceedings of PARLE: Parallel Architecture and Languages Europe, Parallel Architectures, Vol. I, A.J. Nijman, J.W. de Bakker, and P.C. Treleaven, eds., Springer Verlag, Eindhoven, 1987, pp. 152–159.
  • W.-S. Hong and S.-Y. Hsieh, Strong diagnosability and conditional diagnosability of augmented cubes under the comparison diagnosis model, IEEE Trans. Reliab. 61(1) (2012), pp. 140–148. doi: 10.1109/TR.2011.2170105
  • W.-J. Hsu, Fibonacci cubes – A new interconnection topology, IEEE Trans. Parallel Distrib. Syst. 4(1) (1993), pp. 3–12. doi: 10.1109/71.205649
  • J. Kim and K.G. Shin, Operationally enhanced folded hypercubes, IEEE Trans. Parallel Distrib. Syst. 5(12) (1994), pp. 1310–1316. doi: 10.1109/71.334904
  • Q.L. Li and Q. Li, Super edge connectivity properties of connected edge symmetric graphs, Networks 33(2) (1999), pp. 147–159. doi: 10.1002/(SICI)1097-0037(199903)33:2<157::AID-NET6>3.0.CO;2-D
  • T.-K. Li, J.J.M. Tan, L.-H. Hsu, and T.-Y. Sung, The shuffle-cubes and their generalization, Inform. Process. Lett. 77(1) (2001), pp. 35–41. doi: 10.1016/S0020-0190(00)00147-2
  • M. Lü, G.-L. Chen, and J.-M. Xu, On super edge-connectivity of Cartesian product graphs, Networks 49(2) (2007), pp. 135–157. doi: 10.1002/net.20149
  • M. Ma, G. Liu, and J.-M. Xu, The super connectivity of augmented cubes, Inform. Process. Lett. 106(2) (2008), pp. 59–63. doi: 10.1016/j.ipl.2007.10.005
  • F.P. Preparata and J. Vuillemin, The cube-connected cycles: A versatile network for parallel computation, Commun. ACM 24(5) (1981), pp. 300–309. doi: 10.1145/358645.358660
  • Y. Xiang and I.A Stewart, Pancyclicity and Panconnectivity in Augmented k-ary n-cubes, IEEE 15th International Conference on Parallel and Distributed Systems (ICPADS), Shenzhen, China, 2009, pp. 308–315.
  • Y. Xiang and I.A. Stewart, Augmented k-ary n-cubes, Inform. Sci. 181(1) (2011), pp. 239–256. doi: 10.1016/j.ins.2010.09.005
  • J.-M. Xu, M. Lü, M.-J. Ma, and A. Hellwig, Super connectivity of line graphs, Inform. Process. Lett. 94(4) (2005), pp. 191–195. doi: 10.1016/j.ipl.2005.02.001
  • J.-M. Xu, J.-W. Wang, and W.-W. Wang, On super and restricted connectivity of some interconnection networks, Ars Combin. 94 (2010), pp. 25–32.
  • J.-M. Xu, M. Xu, and Q. Zhu, The super connectivity of shuffle-cubes, Inform. Process. Lett. 96(4) (2005), pp. 123–127. doi: 10.1016/j.ipl.2005.07.005
  • Q. Zhu, J.-M. Xu, and M. Lv, Edge fault tolerance analysis of a class of interconnection networks, Appl. Math. Comput. 172(1) (2006), pp. 111–121. doi: 10.1016/j.amc.2005.01.126
  • Q. Zhu, J.-M. Xu, X.-M. Hou, and M. Xu, On reliability of the folded hypercubes, Inform. Sci. 177(8) (2007), pp. 1782–1788. doi: 10.1016/j.ins.2006.11.003

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:

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:

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.