On extra connectivity and extra edge-connectivity of balanced hypercubes

References

• A. Angjeli, E. Cheng, and L. Lipták, Linearly many faults in dual-cube-like networks, Theor. Comput. Sci. 472 (2013), pp. 1–8.
   Web of Science ®Google Scholar
• A. Angjeli, E. Cheng, and L. Lipták, Linearly many faults in augmented cubes, Int J. Parallel, Emerg. Distr. Syst. 28 (2013), pp. 475–483.
   Google Scholar
• N.-W. Chang and S.-Y. Hsieh, 2, 3-Extraconnectivities of hypercube-like networks, J. Comput. System Sci. 79(5) (2013), pp. 669–688.
   Web of Science ®Google Scholar
• N.-W. Chang, C.-Y. Tsai, and S.-Y. Hsieh, On 3-extra connectivity and 3-extra edge connectivity of folded hypercubes, IEEE Trans. Comput. 63(4) (2014), pp. 1593–1599.
   Web of Science ®Google Scholar
• D. Cheng, R.-X. Hao, and Y.-Q. Feng, Two node-disjoint paths in balanced hypercubes, Appl. Math. Comput. 242 (2014), pp. 127–142.
   Web of Science ®Google Scholar
• D. Cheng, R.-X. Hao, and Y.-Q. Feng, Vertex-fault-tolerant cycles embedding in balanced hypercubes, Inform. Sci. 288 (2014), pp. 449–461.
   Web of Science ®Google Scholar
• D. Cheng and R.-X. Hao, Various cycles embedding in faulty balanced hypercubes, Inf. Sci. 297 (2015), pp. 140–153.
   Web of Science ®Google Scholar
• E. Cheng and L. Lipták, Linearly many faults in Cayley graphs generated by transposition trees, Inf. Sci. 177 (2007), pp. 4877–4882.
   Web of Science ®Google Scholar
• E. Cheng, L. Lipták, and F. Sala, Linearly many faults in 2-tree-generated networks, Networks 55 (2010), pp. 90–98.
   Web of Science ®Google Scholar
• E. Cheng, L. Lipták, and A. Yuan, Linearly many faults in arrangement graphs, Networks 61 (2013), pp. 281–289.
   Web of Science ®Google Scholar
• E. Cheng, K. Qiu, and Z. Shen, Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults, IEEE 17th International Conference Computing Science Engineering (2014), Chengdu, pp. 1213–1220.
   Google Scholar
• A.H. Esfahanian, Generalized measures of fault tolerance with application to N-cube networks, IEEE Trans. Comput. 38 (1989), pp. 1586–1591.
   Web of Science ®Google Scholar
• J. Fàbrega and M.A. Fiol, Extraconnectivity of graphs with large girth, Discret. Math. 127 (1994), pp. 163–170.
   Web of Science ®Google Scholar
• J. Fàbrega and M.A. Fiol, On the extraconnectivity of graphs, Discret. Math. 155 (1996), pp. 49–57.
   Web of Science ®Google Scholar
• M.-M. Gu and R.-X. Hao, 3-extra connectivity of 3-ary n-cube network, Inf. Process. Lett. 114 (2014), pp. 486–491.
   Web of Science ®Google Scholar
• L. Guo, C. Qin, and X. Guo, Super connectivity of Kronecker products of graphs, Inf. Process. Lett. 110 (2010), pp. 659–661.
   Web of Science ®Google Scholar
• L. Guo and X. Guo, Fault tolerance of hypercubes and folded hypercubes, J. Supercomput. 68 (2014), pp. 1235–1240.
   Web of Science ®Google Scholar
• F. Harary, Conditional connectivity, Networks 13(3) (1983), pp. 347–357.
   Web of Science ®Google Scholar
• S.-Y. Hsieh and Y.-H. Chang, Extraconnectivity of k-ary n-cube networks, Theor. Comput. Sci. 443 (2012), pp. 63–69.
   Web of Science ®Google Scholar
• L.-H. Hsu, E. Cheng, L. Lipták, J.J.M. Tan, C.-K. Lin, and T.-Y. Ho, Component connectivity of the hypercubes, Int. J. Comput. Math. 89(2) (2012), pp. 137–145.
   Web of Science ®Google Scholar
• K. Huang and J. Wu, Fault-tolerant resource placement in balanced hypercubes, Inf. Sci. 99 (1997), pp. 159–172.
   Web of Science ®Google Scholar
• R. Lin and H. Zhang, The restricted edge-connectivity and restricted connectivity of augmented k-ary n-cubes, Int. J. Comput. Math. (2015). Available at http://dx.doi.org/10.1080/00207160.2015.1067690.
   Web of Science ®Google Scholar
• H. Lü, X. Li, and H. Zhang, Matching preclusion for balanced hypercubes, Theor. Comput. Sci. 465 (2012), pp. 10–20.
   Web of Science ®Google Scholar
• H. Lü and H. Zhang, Hyper-Hamiltonian laceability of balanced hypercubes, J. Supercomput. 68 (2014), pp. 302–314.
   Web of Science ®Google Scholar
• M. Lü, G.-L. Chen, and J.-M. Xu, On super edge-connectivity of Cartesian product graphs, Networks 49(2) (2007), pp. 135–157.
   Web of Science ®Google Scholar
• M. Ma, G. Liu, and J.-M. Xu, The super connectivity of augmented cubes, Inf. Process. Lett. 106 (2008), pp. 59–63.
   Web of Science ®Google Scholar
• M. Ma and L. Zhu, The super connectivity of exchanged hypercubes, Inf. Process. Lett. 111 (2011), pp. 360–364.
   Web of Science ®Google Scholar
• D.B. West, Introduction to Graph Theory, 2nd ed., Upper Saddle River, NJ: Prentice-Hall, 2001.
   Google Scholar
• J. Wu and K. Huang, The balanced hypercube: a cube-based system for fault-tolerant applications, IEEE Trans. Comput. 46(4) (1997), pp. 484–490.
   Web of Science ®Google Scholar
• J.-M. Xu, M. Lü, M.-J. Ma, and A. Hellwig, Super connectivity of line graphs, Inf. Process. Lett. 94(4) (2005), pp. 191–195.
   Web of Science ®Google Scholar
• J.-M. Xu, M. Xu, and Q. Zhu, The super connectivity of shuffle-cubes, Inf. Process. Lett. 96 (2005), pp. 123–127.
   Web of Science ®Google Scholar
• M. Xu, H. Hu, and J. Xu, Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes, Appl. Math. Comput. 189 (2007), pp. 1393–1401.
   Web of Science ®Google Scholar
• M.-C. Yang, Bipanconnectivity of balanced hypercubes, Comput. Math. Appl. 60 (2010), pp. 1859–1867.
   Web of Science ®Google Scholar
• M.-C. Yang, Super connectivity of balanced hypercubes, Appl. Math. Comput. 219 (2012), pp. 970–975.
   Web of Science ®Google Scholar
• W. Yang and H. Li, On reliability of the folded hypercubes in terms of the extra edge-connectivity, Inf. Sci. 272 (2014), pp. 238–243.
   Web of Science ®Google Scholar
• X. Yang, D.J. Evans, B. Chen, G.M. Megson, and H. Lai, On the maximal connected component of hypercube with faulty vertices, Int. J. Comput. Math. 81(5) (2004), pp. 515–525.
   Web of Science ®Google Scholar
• X. Yang, D.J. Evans, and G.M. Megson, On the maximal connected component of hypercube with faulty vertices (II), Int. J. Comput. Math. 81(10) (2004), pp. 1175–1185.
   Web of Science ®Google Scholar
• X. Yang, D.J. Evans, and G.M. Megson, On the maximal connected component of hypercube with faulty vertices (III), Inter. J. Comput. Math. 83(1) (2006), pp. 27–38.
   Web of Science ®Google Scholar
• A. Yuan, E. Cheng, and L. Lipták, Linearly many faults in (n,k)-star graphs, Int. J. Found. Comput. Sci. 22 (2011), pp. 1729–1745.
   Web of Science ®Google Scholar
• M. Zhang, J. Meng, W. Yang, and Y. Tian, Reliability analysis of bijective connection networks in terms of the extra edge-connectivity, Inf. Sci. 279 (2014), pp. 374–382.
   Web of Science ®Google Scholar
• M.-M. Zhang and J.-X. Zhou, On g-extra connectivity of folded hypercubes, Theor. Comput. Sci. 593 (2015), pp. 146–153.
   Web of Science ®Google Scholar
• Q. Zhou, D. Chen, and H. Lü, Fault-tolerant Hamiltonian laceability of balanced hypercubes, Inf. Sci. 300 (2015), pp. 20–27.
   Web of Science ®Google Scholar
• J.-X. Zhou, Z.-L. Wu, S.-C. Yang, and K.-W. Yuan, Symmetric property and reliability of balanced hypercube, IEEE Trans. Comput. 64 (2015), pp. 876–881.
   Web of Science ®Google Scholar
• Q. Zhu, J.-M. Xu, and M. Lü, Edge fault tolerance analysis of a class of interconnection networks, Appl. Math. Comput. 172(1) (2006), pp. 111–121.
   Web of Science ®Google Scholar