Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 92, 2015 - Issue 3
Submit an article Journal homepage
66
Views
5
CrossRef citations to date
0
Altmetric
Section A

Strong matching preclusion for two-dimensional torus networks

Kai FengSchool of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi030006, ChinaCorrespondence[email protected]
&
Shiying WangSchool of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi030006, China;College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan453007, China
Pages 473-485 | Received 22 Oct 2013, Accepted 01 Apr 2014, Published online: 08 May 2014

References

  • J.A. Bondy and U.S.R. Murty, Graph Theory, Springer, New York, 2008.
  • P. Bonneville, E. Cheng, and J. Renzi, Strong matching preclusion for the alternating group graphs and split-stars, J. Interconnection Netw. 12(4) (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(2) (2007), pp. 173–180. doi: 10.1002/net.20187
  • E. Cheng and L. Lipták, Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products, Discrete Appl. Math. 160(12) (2012), pp. 1699–1716. doi: 10.1016/j.dam.2012.03.014
  • E. Cheng, L. Lesniak, M.J. Lipman, and L. Lipták, Conditional matching preclusion sets, Inform. Sci. 179(8) (2009), pp. 1092–1101. doi: 10.1016/j.ins.2008.10.029
  • E. Cheng, D. Lu, and B. Xu, Strong matching preclusion of pancake graphs, J. Interconnection Netw. 14(2) (2013), 10.1142/S0219265913500072.
  • E. Cheng, S. Shah, V. Shah, and D.E. Steffy, Strong matching preclusion for augmented cubes, Theoret. Comput. Sci. 491 (2013), pp. 71–77. doi: 10.1016/j.tcs.2013.05.002
  • H.-C. Kim and J.-H. Park, Fault Hamiltonicity of Two-Dimensional Torus Networks, Proceedings of Workshop on Algorithms and Computation WAAC’00, Tokyo, Japan, 2000, pp. 110–117.
  • M. Liang, X. Xu, J. Liang, and Z. Shao, Upper bounds on the connection probability for 2-D meshes and tori, J. Parallel Distrib. Comput. 72(2) (2012), pp. 185–194. doi: 10.1016/j.jpdc.2011.11.006
  • J.-H. Park, Matching preclusion problem in restricted HL-graphs and recursive circulant G(2m, 4), J. KIISE 35(2) (2008), pp. 60–65.
  • J.-H. Park and I. Ihm, Strong matching preclusion, Theoret. Comput. Sci. 412(45) (2011), pp. 6409–6419. doi: 10.1016/j.tcs.2011.08.008
  • J.-H. Park and I. Ihm, Strong matching preclusion under the conditional fault model, Discrete Appl. Math. 161(7–8) (2013), pp. 1093–1105. doi: 10.1016/j.dam.2012.10.002
  • F.-H. Wang, The lower and upper forcing geodetic numbers of complete n-partite graphs, n-dimensional meshes and tori, Int. J. Comput. Math. 87(12) (2010), pp. 2677–2687. doi: 10.1080/00207160903003302
  • S. Wang and K. Feng, Strong matching preclusion for torus networks, Theoret. Comput. Sci. 520 (2014), pp. 97–110. doi: 10.1016/j.tcs.2013.10.023
  • S. Wang, R. Wang, S. Lin, and J. Li, Matching preclusion for k-ary n-cubes, Discrete Appl. Math. 158(18) (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(18) (2013), pp. 3054–3062. doi: 10.1016/j.dam.2013.06.011
  • J. Yuan, A. Liu, H. Wu, and J. Li, Panconnectivity of n-dimensional torus networks with faulty vertices and edges, Discrete Appl. Math. 161(3) (2013), pp. 404–423. doi: 10.1016/j.dam.2012.08.027

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.