Abstract
The fractional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings, and the fractional strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion leaves a resulting graph with no fractional perfect matchings. In this paper, we determine these two numbers for the restricted HL-graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aldred REL, Anstee RP, Locke SC (2007) Perfect matchings after vertex deletions. Discrete Math 307:3048–3054
Bondy JA, Murty USR (2008) Graph theory. Springer, Berlin
Brigham RC, Harary F, Violin EC, Yellen J (2005) Perfect-matching preclusion. Congr Numer 174:185–192
Chedid FB (1995) On the generalized twisted cube. Inf Process Lett 55:49–52
Cull P, Larson S (1991) The Möbius cubes. In: Proceedings of the 6th IEEE distributed memory computing conference, pp 699–702
Efe K (1991) A variation on the hypercube with lower diameter. IEEE Trans Comput 40:1312–1316
Efe K (1992) The crossed cube architecture for parallel computation. IEEE Trans Parallel Distrib Syst 3:513–524
Guichard DR (2008) Perfect matchings in pruned grid graphs. Discrete Math 308:6552–6557
Hilbers PAJ, Koopman MRJ, van de Snepscheut JLA (1987) The twisted cube, PARLE: parallel architectures and languages Europe vol 1: parallel architectures. Springer, Berlin, pp 152–159
Hong WS, Hsieh SY (2013) Extra edge connectivity of hypercube-like networks. Int J Parallel Emergent Distrib Syst 28:123–133
Hsieh SY, Lee CW (2009) Conditional edge-fault hamiltonicity of matching composition networks. IEEE Trans Parallel Distrib Syst 20:581–592
Lai PL, Tan JJM, Tsai CH, Hsu LH (2004) The diagnosability of the matching composition network under the comparison diagnosis model. IEEE Trans Comput 53:1064–1069
Liu Y, Liu WW (2017) Fractional matching preclusion of graphs. J Comb Optim 34:522–533
Park JH (2008) Matching preclusion problem in restricted HL-graphs and recursive circulant \(G(2^m, 4)\). J KIISE 35:60–65
Park JH, Ihm IS (2011) Strong matching preclusion. Theor Comput Sci 412:6409–6419
Park JH, Ihm IS (2013) Strong matching preclusion under the conditional fault model. Discrete Appl Math 161:1093–1105
Park JH, Kim HC, Lim HS (2005) Fault-hamiltonicity of hypercube-like interconnection networks. In: Proceedings of IEEE international parallel and distributed processing symposium IPDPS 2005, Denver
Park JH, Kim HC, Lim HS (2009) Many-to-many disjoint path covers in the presence of faulty elements. IEEE Trans Comput 58:528–540
Park JH, Son SH (2009) Conditional matching preclusion for hypercube-like interconnection networks. Theor Comput Sci 410:2632–2640
Scheinerman ER, Ullman DH (1997) Fractional graph theory: a rational approach to the theory of graphs. Wiley, New York
Yang X, Evans DJ, Megson GM (2005) The locally twisted cubes. Int J Comput Math 82:401–413
Zhou JX (2017) On \(g\)-extra connectivity of hypercube-like networks. J Comput Syst Sci 88:208–219
Zhu XD (2017) A hypercube variant with small diameter. J Graph Theory 85:651–660
Acknowledgements
Huiqing Liu is partially supported by NNSFC under Grant Number 11571096. Xiaolan Hu is partially supported by NNSFC under Grant Number 11601176.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, S., Liu, H., Li, D. et al. Fractional matching preclusion of the restricted HL-graphs. J Comb Optim 38, 1143–1154 (2019). https://doi.org/10.1007/s10878-019-00441-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-019-00441-x