Star structure connectivities of pancake graphs and burnt pancake graphs

References

• Esfahanian AH. Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans Comput. 1989;38:1586–1591.
   Web of Science ®Google Scholar
• Harary F. Conditional connectivity. Networks. 1983;13:347–357.
   Web of Science ®Google Scholar
• Hellwing A, Rantenbach D, Volkmann L. Cuts leaving components of given minimun order. Discrete Appl Math. 2005;292:55–65.
   Google Scholar
• Fàbrega J, Fiol MA. On the extraconnectivity of graphs. Discrete Appl Math. 1996;155:49–57.
   Google Scholar
• Latifi S, Hegde M, Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Trans Comput. 1994;43:218–222.
   Web of Science ®Google Scholar
• Yang YX, Wang SY. Conditional connectivity of star graph networks under embedding restriction. Inf Sci. 2012;199:187–192.
   Web of Science ®Google Scholar
• Zhao SL, Yang WH, Zhang SR. Component connectivity of hypercube. Theor Comput Sci. 2016;640:115–118.
   Web of Science ®Google Scholar
• Lin C-K, Zhang LL, Fan JX, et al. Structure connectivity and substructure connectivity of hypercubes. Theor Comput Sci. 2016;634:97–107.
   Web of Science ®Google Scholar
• Sabir E, Meng JX. Structure fault tolerance of hypercubes and folded hypercubes. Theor Comput Sci. 2018;711:44–55.
   Web of Science ®Google Scholar
• Zhang GZ, Lin SW. Path and cycle fault tolerance of bubble-sort graph networks. Theor Comput Sci. 2019;779:8–16.
   Web of Science ®Google Scholar
• Zhang GZ, Wang DJ. Structure connectivity and substructure connectivity of bubble-sort star graph networks. Appl Math Comput. 2019;363:124632.
   Web of Science ®Google Scholar
• Wang GJ, Lin C-K, Cheng BL, et al. Structure fault-tolerance of the generalized hypercube. Comput J. 2019;62:1463–1476.
   Web of Science ®Google Scholar
• Li CF, Lin SW, Li SJ. Structure connectivity and substructure connectivity of (n,k)-star graph networks. 2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN). Yichang, China, IEEE; 2018. p. 240–246.
   Google Scholar
• Lin HQ, Cheng DQ. Structure fault tolerance of balanced hypercubes. Theor Comput Sci. 2020;845:198–207.
   Web of Science ®Google Scholar
• Li D, Hu XL, Liu HQ. Structure connectivity and substructure connectivity of twisted hypercubes. Theor Comput Sci. 2019;796:169–179.
   Web of Science ®Google Scholar
• Zhang GZ, Wang DJ. Structure connectivity and substructure connectivity of k-ary n-cube networks. IEEE Access. 2019;7:134496–134504.
   Web of Science ®Google Scholar
• Li CF, Lin SW, Li SJ. Structure connectivity and substructure connectivity of star graphs. Discrete Appl Math. 2020;284:472–480.
   Web of Science ®Google Scholar
• Pan ZW, Cheng DQ. Structure connectivity and substructure connectivity of the crossed cube. Theor Comput Sci. 2020;824–825:67–80.
   Web of Science ®Google Scholar
• Lei Y, Meng JX. Structure Fault-tolerance of arrangement graphs. Appl Math Comput. 2020;381:125287.
   Web of Science ®Google Scholar
• Li XW, Zhou SM, Ren XY, et al. Structure connectivity and substructure connectivity of alternating group graphs. Appl Math Comput. 2021;391:125639.
   Web of Science ®Google Scholar
• Sabir E, Meng JX. Structure Fault tolerance of recursive interconnection networks. Comput. J. 2020. doi:10.1093/comjnl/bxz159.
   Web of Science ®Google Scholar
• Yang YX. Characterizations of minimum structure- and substructure-cuts of hypercubes. Comput J. 2019;62:1313–1321.
   Web of Science ®Google Scholar
• Akers SB, Krishnamurthy B. A group theoretic model for symmetric interconnection networks. IEEE Trans Comput. 1989;38:555–566.
   Web of Science ®Google Scholar
• Compeau PEC. Girth of pancake graphs. Discrete Appl Math. 2011;159:1641–1645.
   Web of Science ®Google Scholar
• Kanevsky A, Feng C. On the embedding of cycles in pancake graphs. Parallel Comput. 1995;21:923–936.
   Web of Science ®Google Scholar
• Chin C, Weng T-H, Hsu L-H, et al. The spanning connectivity of the burnt pancake graphs. IEICE Trans Inf Syst. 2009;92:389–400.
   Google Scholar
• Iwasaki T, Kaneko K. Fault-tolerant routing in burnt pancake graphs. Inf Pro Lett. 2010;110:535–539.
   Web of Science ®Google Scholar
• Song SL, Li XY, Zhou SM, et al. Fault tolerance and diagnosability of burnt pancake networks under the comparison model. Theor Comput Sci. 2015;582:48–59.
   Web of Science ®Google Scholar
• Bondy JA, Murty USR. Graph theory. New York: Springer; 2008.
   Google Scholar
• Gates WH, Papadimitriou CH. Bounds for sorting by prefix reversal. Discrete Math. 1979;27:47–57.
   Web of Science ®Google Scholar
• Song SL, Zhou SM, Li XY. Conditional diagnosability of burnt pancake networks under the PMC model. Comput J. 2016;59(1):91–105.
   Web of Science ®Google Scholar