Advanced search
Publication Cover
International Journal of Computer Mathematics: Computer Systems Theory Volume 4, 2019 - Issue 1
Submit an article Journal homepage
285
Views
0
CrossRef citations to date
0
Altmetric
Articles

Strong matching preclusion problem of the folded Petersen cubeFootnote*

Eddie ChengDepartment of Mathematics and Statistics, Oakland University, Rochester, MI, United States
,
Spencer LiuTroy High School, Troy, MI, United States
,
Chris MelekianDepartment of Mathematics and Statistics, Oakland University, Rochester, MI, United States
,
Karimah SweetDepartment of Mathematics, Lafayette College, Easton, PA, United StatesCorrespondence[email protected]
,
Chittesh ThavamaniTroy High School, Troy, MI, United States
&
Freddie ZhaoTroy High School, Troy, MI, United States
Pages 1-15 | Received 30 Jul 2018, Accepted 16 Nov 2018, Published online: 12 Dec 2018

References

  • P. Bonneville, E. Cheng, and J. Renzi, Strong matching preclusion for the alternating group graphs and split stars, J. Interconnect. Networks 12 (2011), pp. 277–298. doi: 10.1142/S0219265911003003
  • R.C. Brigham, F. Harary, E.C. Violin, and J. Yellen, Perfect-matching preclusion, Congr. Numer. 174 (2005), pp. 185–192.
  • E. Cheng and L. Lipták, Matching preclusion for some interconnection networks, Networks 50 (2007), pp. 173–180. doi: 10.1002/net.20187
  • E. Cheng and L. Lipták, An addendum to “Matching preclusion for some interconnection networks” and “Matching preclusion for the (n,k)-bubble-sort graphs”. Tech. Rep. Department of Mathematics and Statistics, Oakland University, 2013.
  • E. Cheng, L. Lesniak, M.J. Lipman, and L. Lipták, Matching preclusion for alternating group graphs and their generalizations, Int. J. Found. Comput. Sci. 19 (2008), pp. 1413–1437. doi: 10.1142/S0129054108006364
  • E. Cheng, L. Lesniak, M.J. Lipman, and L. Lipták, Conditional matching preclusion sets, Inform. Sci. 179 (2009), pp. 1092–1101. doi: 10.1016/j.ins.2008.10.029
  • E. Cheng, P. Hu, R. Jia, and L. Lipták, Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions, Networks 59 (2012), pp. 349–356. doi: 10.1002/net.20440
  • E. Cheng, P. Hu, R. Jia, and L. Lipták, Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars, Networks 59 (2012), pp. 357–364. doi: 10.1002/net.20441
  • E. Cheng, P. Hu, R. Jia, L. Lipták, B. Scholten, and J. Voss, Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs, Int. J. Parallel Emergent Distrib. Syst. 29 (2014), pp. 499–512. doi: 10.1080/17445760.2013.847441
  • E. Cheng, R. Connolly, and C. Melekian, Matching preclusion and conditional matching preclusion problems for the folded Petersen cube, Theor. Comput. Sci. 576 (2015), pp. 30–44. doi: 10.1016/j.tcs.2015.01.046
  • E. Cheng, J. Kelm, and J. Renzi, Strong matching preclusion of (n,k)-star graphs, Theor. Comput. Sci. 615 (2016), pp. 91–101. doi: 10.1016/j.tcs.2015.11.051
  • L.-H. Hsu and C.-K. Lin, Graph Theory and Interconnection Networks, CRC Press, Boca Raton, 2009.
  • X. Hu and H. Liu, The (conditional) matching preclusion for burnt pancake graph, Discrete Appl. Math. 161 (2013), pp. 1481–1489. doi: 10.1016/j.dam.2013.01.010
  • J.-H. Park, Matching preclusion problem in restricted HL-graphs and recursive circulant g(2m,4), J. KISS 35 (2008), pp. 60–65.
  • J.-H. Park and I. Ihm, Strong matching preclusion, Theor. Comput. Sci. 412 (2011), pp. 6409–6419. doi: 10.1016/j.tcs.2011.08.008
  • J.-H. Park and S.H. Son, Conditional matching preclusion for hypercube-like interconnection networks, Theor. Comput. Sci. 410 (2009), pp. 2632–2640. doi: 10.1016/j.tcs.2009.02.041
  • S. Wang, R. Wang, S. Lin, and J. Li, Matching preclusion for k-ary n-cubes, Discrete Appl. Math. 158 (2010), pp. 2066–2070. doi: 10.1016/j.dam.2010.08.017
  • S. Wang, K. Feng, and G. Zhang, Strong matching preclusion for k-ary n-cubes, Discrete Appl. Math. 161 (2013), pp. 3054–3062. doi: 10.1016/j.dam.2013.06.011

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.