Fractional matching preclusion for restricted hypercube-like graphs
From MaRDI portal
Publication:6318596
DOI10.1142/S0219265919400103arXiv1905.04631WikidataQ127291354 ScholiaQ127291354MaRDI QIDQ6318596FDOQ6318596
Publication date: 11 May 2019
Abstract: The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the concept matching preclusion. In this paper, we obtain fractional matching preclusion number and fractional strong matching preclusion numbers of restricted hypercube-like graphs, which extend some known results.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Fractional matching preclusion for restricted hypercube-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6318596)
