Fractional matching preclusion for generalized augmented cubes

MaRDI QIDQ5207842zbMATH OpenFDO

Authors Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian

Publication date 13 January 2020

Full work available at URL https://arxiv.org/abs/1901.03194, https://dmtcs.episciences.org/5688/pdf

zbMATH Keywords

fractional matching preclusionfractional strong matching preclusiongeneralized augmented cubematching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number. The emph{fractional matching preclusion number} of $G$ is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The emph{fractional strong matching preclusion number} of $G$ is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional matching preclusion number and the fractional strong matching preclusion number for generalized augmented cubes. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.

Recommendations

• Fractional matching preclusion for arrangement graphs
• Fractional matching preclusion number of graphs
• Fractional matching preclusion for (n,k)-star graphs
• Fractional matching preclusion of product networks
• Fractional strong matching preclusion for two variants of hypercubes

Cited in

(9)

• Fractional matching preclusion number of graphs
• Fractional matching preclusion for arrangement graphs
• Strong matching preclusion for augmented cubes
• Fractional Strong Matching Preclusion for DHcube
• Fractional matching preclusion for (n,k)-star graphs
• Fractional matching preclusion for radix triangular mesh
• Fractional strong matching preclusion for two variants of hypercubes
• Fractional matching preclusion for butterfly derived networks
• Integer \(k\)-matching preclusion of some interconnection networks

This page was built for publication: Fractional matching preclusion for generalized augmented cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207842)