Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs

References

• R.C. Brigham, F. Harary, E.C. Violin, and J. Yellen, Perfect-matching preclusion, Congr. Numer. 174 (2005), pp. 185–192.
   Google Scholar
• R. Bennes, S. Latifi, and N. Kiruma, A comparative study of job allocation and migration in the pancake network, Inform. Sci. 177(11) (2007), pp. 2327–2335.
   Web of Science ®Google Scholar
• J.A. Bondy and U.S.R. Murty, Graph Theory, GTM244, Springer, 2008).
   Google Scholar
• E. Cheng and L. Liptak, Matching preclusion for some interconnection networks, Networks 50(2) (2007), pp. 173–180.
   Web of Science ®Google Scholar
• E. Cheng, L. Lesniak, M.J. Lipman, and L. Liptak, Conditional matching preclusion sets, Inform. Sci.179(8) (2009), pp. 1092–1101.
   Web of Science ®Google Scholar
• E. Cheng, R. Jia, and D. Lu, Matching preclusion and conditional matching preclusion for augmented cubes, JOIN 11 (2010), pp. 35–60.
   Google Scholar
• E. Cheng, S. Shah, V. Shah, and D.-E. Steffy, Strong matching preclusion for augmented cubes, Theor. Comput. Sci. 491 (2013), pp. 71–77.
   Web of Science ®Google Scholar
• E. Cheng, P. Hu, R. Jia, L. Liptak, B. Scholten, and J. Voss, Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs, Int. J. Parallel Emergent Distrib. Syst.29(5) (2014), pp. 499–512.
   Google Scholar
• E. Cheng, J.-T. Kelm, R. Orzach, and B. Xu, Strong matching preclusion of burnt pancake graphs, Int. J. Parallel Emergent Distrib. Syst. 31(3) (2016), pp. 220–232.
   Web of Science ®Google Scholar
• P.E.C. Compeau, Girth of pancake graphs, Discrete Appl. Math. 159(15) (2011), pp. 1641–1645.
   Web of Science ®Google Scholar
• W.H. Gates and C.H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Math. 27(1) (1979), pp. 47–57.
   Web of Science ®Google Scholar
• Q.-P. Gu, S. Peng, and I.H. Sudborough, A 2-approximation algorithm for genome rearrangements by reversals and transpositions, Theor. Comput. Sci. 210 (1999), pp. 327–339.
   Web of Science ®Google Scholar
• S. Gupta, E. Cheng, and L. Lipták, Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract), The 27th International Computing and Combinatorics Conference Proceedings, Tainan, Taiwan, 2021, pp. 425–435.
   Google Scholar
• X.L. Hu and H.Q. Liu, The (conditional) matching preclusion for burnt pancake graph, Discrete Appl. Math. 161(10–11) (2013), pp. 1481–1489.
   Web of Science ®Google Scholar
• C.-N. Hung, H.-C. Hsu, K.-Y. Liang, and L.H. Hsu, Ring embedding in faulty pancake graphs, Inform. Proc. Lett. 86(5) (2003), pp. 271–275.
   Web of Science ®Google Scholar
• K. Kaneko, Hamiltonian cycles and Hamiltonian paths in faulty burnt pancake graphs, IEICE-Trans. Inform. Sys. E90-D(4) (2007), pp. 716–721.
   Google Scholar
• Q.L. Li, J.H. He, and H.P. Zhang, Matching preclusion for vertex-transitive networks, Discrete Appl. Math. 207 (2016), pp. 90–98.
   Web of Science ®Google Scholar
• C.-K. Lin, H.-M. Huang, and L.-H. Hsu, The super connectivity of the pancake graph and the super laceability of the star graph, Theor. Comput. Sci. 339(2–3) (2005), pp. 257–271.
   Web of Science ®Google Scholar
• Y. Liu and W. Liu, Fractional matching preclusion of graphs, J. Comb. Optim. 34(2) (2016), pp. 522–533.
   Web of Science ®Google Scholar
• T. Ma, Y. Mao, E. Cheng, and C. Melekian, Fractional matching preclusion for (Burnt) pancake graphs, Proceedings to the Fifteen International Symposium on Pervasive, Algorithms, and Networks, Yichang, China, 2018, pp. 133–141.
   Google Scholar
• Y. Mao, Z. Wang, E. Cheng, and C. Melekian, Strong matching preclusion number of graphs, Theor. Comput. Sci. 713 (2018), pp. 11–20.
   Web of Science ®Google Scholar
• R.S. Mohamed A., Ramakrishna, Linear election in pancake graphs, Inform. Proc. Lett. 106 (2008), pp. 127–131.
   Web of Science ®Google Scholar
• J.-H. Park and I. Ihm, Strong matching preclusion, Theor. Comput. Sci. 412(45) (2011), pp. 6409–6419.
   Web of Science ®Google Scholar
• E.R. Scheinerman and D.H. Ullman, Fractional Graph Theory: A Rational Approach to the Theory of Graphs, John Wiley, New York, 1997.
   Google Scholar
• P.-Y. Tsai, J.-S. Fu, and G.-H. Chen, Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model, Theor. Comput. Sci. 409(3) (2008), pp. 450–460.
   Web of Science ®Google Scholar