Super extra edge-connectivity in regular networks with edge faults

References

• Wang X, Fan J, Zhou J, et al. The restricted h-connectivity of the date center network DCell. Discrete Appl Math. 2016;203:144–157. doi: 10.1016/j.dam.2015.09.002
   Web of Science ®Google Scholar
• Boccaletti S, Latora V, Moreno Y, et al. Complex networks: structure and dynamics. Phys Rep. 2006;424(45):175–308. doi: 10.1016/j.physrep.2005.10.009
   Web of Science ®Google Scholar
• Wu J, Wang Y. Hypercube-based multi-path social feature routing in human contract networks. IEEE Trans Comput. 2014;63(2):383–396. doi: 10.1109/TC.2012.209
   Web of Science ®Google Scholar
• Hsieh SY, Tasi CY. On extra connectivity and extra edge connectivity measures of folded hypercubes. IEEE Trans Comput. 2013;63(6):1594–1600.
   Web of Science ®Google Scholar
• Fàbrega J, Fiol MA. Extraconnectivity of graphs with large girth. Discrete Math. 1994;127:163–170. doi: 10.1016/0012-365X(92)00475-7
   Web of Science ®Google Scholar
• Fàbrega J, Fiol MA. On the extraconnectivity of graphs. Discrete Math. 1996;155:49–57. doi: 10.1016/0012-365X(94)00369-T
   Web of Science ®Google Scholar
• Hong ZM, Xu JM. Vulnerability of super edge-connected networks. Theor Comput Sci. 2014;520:75–86. doi: 10.1016/j.tcs.2013.10.021
   Web of Science ®Google Scholar
• Cheng C-W, Hsieh S-Y, Cheng C-W, et al. Vulnerability of the super extra edge-connected graphs. J Comput Syst Sci. 2020;108:1–9. doi: 10.1016/j.jcss.2019.07.002
   Web of Science ®Google Scholar
• Hong Y, Zhang Z. Vertex fault tolerance of optimal-κ graphs and super-κ graphs. Inf Process Lett. 2009;109:1151–1155. doi: 10.1016/j.ipl.2009.07.004
   Web of Science ®Google Scholar
• Hong Y, Meng J, Zhang Z. Edge fault tolerance of graphs with respect to super edge connectivity. Discrete Appl Math. 2012;160:579–587. doi: 10.1016/j.dam.2011.10.033
   Web of Science ®Google Scholar
• Sun GX, Zhao S, Meng JX. Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity. Theoret Comput Sci. 2019;758:9–16. doi: 10.1016/j.tcs.2018.07.020
   Web of Science ®Google Scholar
• Wang D, Lu M. Edge fault tolerance of super edge connectivity for three families of interconnection networks. Inf Sci. 2012;188:260–268. doi: 10.1016/j.ins.2011.11.006
   Web of Science ®Google Scholar
• Wang SY, Zhang G, Feng K. Edge fault tolerance of Cartesian product graphs on super restricted edge-connectivity. Comput J. 2018;61:761–772. doi: 10.1093/comjnl/bxx109
   Web of Science ®Google Scholar
• Zhao S, Chen Z, Yang W, et al. Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs. J Comput Syst Sci., to appear.
   Web of Science ®Google Scholar
• Bondy JA, Murty USR. Graph theory. GTM 244. Springer; 2008.
   Google Scholar
• Chen YC, Tan JJM. Restricted connectivity for three families of interconnection networks. Appl Math Comput. 2007;188:1848–1855.
   Web of Science ®Google Scholar
• Shi TL, Lu M. Fault-tolerance diameter for three families interconnection networks. J Comb Optim. 2012;23:471–482. doi: 10.1007/s10878-010-9362-2
   Google Scholar
• Akers SB, Harel D, Krishnamurthy B. The star graph: an attractive alternative to the n-cube. Proceedings of Internet Conference on Parallel Processing; St. Charles (IL); 1987. p. 393–400.
   Google Scholar
• Gargano L, Vaccaro U, Vozella A. Fault tolerant routing in the star and pancake interconnection networks. Inf Process Lett. 1993;45:315–320. doi: 10.1016/0020-0190(93)90043-9
   Web of Science ®Google Scholar
• Cheng E, Lipták L. Linearly many faults in Cayley graphs generated by transposition trees. Inf Sci. 2007;177:4877–4882. doi: 10.1016/j.ins.2007.05.034
   Web of Science ®Google Scholar
• Akers SB, Krishnamurthy B. A group theoretic model for symmetric interconnection networks. IEEE Trans Comput. 1989;38(4):555–566. doi: 10.1109/12.21148
   Web of Science ®Google Scholar
• Heydemann MC. Cayley graphs and interconnection networks. In: Hahn G, Sabidussi G, editors. Graph symmetry. Kluwer Academic Publishing; 1997. p. 167–224.
   Google Scholar
• Hsieh SY, Hsiao TT. The k-degree Cayley graph and its topological properties. Networks. 2006;47:26–36. doi: 10.1002/net.20096
   Web of Science ®Google Scholar
• Lakshmivarahan S, Jwo JS, Dhall SK. Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey. Parallel Comput. 1993;19:361–407. doi: 10.1016/0167-8191(93)90054-O
   Web of Science ®Google Scholar
• Yu XM, Huang XH, Zhang Z. A kind of conditional connectivity of Caley graphs generated by unicyclic graphs. Inf Sci. 2013;243:86–94. doi: 10.1016/j.ins.2013.04.011
   Web of Science ®Google Scholar
• Zhou S. A Class of arc transitive Cayley graphs as models for interconnection networks. SIAM J Discrete Math. 2009;23:694–714. doi: 10.1137/06067434X
   Web of Science ®Google Scholar
• Xu JM. Theory and application of graphs. Dordrecht: Kluwer Academic Publishers; 2003.
   Google Scholar
• Yang WH, Li H, Meng JX. Conditional connectivity of Cayley graphs generated by transposition trees. Inf Process Lett. 2010;110:1027–1030. doi: 10.1016/j.ipl.2010.09.001
   Web of Science ®Google Scholar
• Zhang Z, Yuan J. A proof of an inequality concerning k-restricted edge-connectivity. Discrete Math. 2005;304:128–134. doi: 10.1016/j.disc.2005.04.020
   Web of Science ®Google Scholar
• Zhou JX. Super restricted edge connectivity of regular edge transitive graphs. Discrete Appl Math. 2012;160:1248–1252. doi: 10.1016/j.dam.2011.12.004
   Web of Science ®Google Scholar
• Zhang Z, Huang XH. Restricted edge connectivity in transitive graphs. J XinJiang Univ. 2004;21:357–360.
   Google Scholar
• Wu J, Huang K. The balanced hypercubes: a cube-based system for fault-tolerant application. IEEE Trans Comput. 1997;46(4):484–490. doi: 10.1109/12.588063
   Web of Science ®Google Scholar
• Zhou JX, Wu ZL, Yang SC, et al. Symmetric property and reliability of balanced hypercube. IEEE Trans Comput. 2015;64(3):876–881. doi: 10.1109/TC.2014.2304391
   Web of Science ®Google Scholar
• Kanevsky A, Feng C. On the embedding of cycles in pancake graphs. Parallel Comput. 1995;21:923–936. doi: 10.1016/0167-8191(94)00096-S
   Web of Science ®Google Scholar