Fractional matching preclusion of graphs

DOI10.1007/S10878-016-0077-XMaRDI QIDQ2410101zbMATH OpenOpenAlexFDO

Authors Yan Liu, Weiwei Liu

Publication date 17 October 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-016-0077-x

zbMATH Keywords

complete graphsfractional perfect matchingfractional strong matching preclusion numberPetersen graphtwisted cubes

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Fault-tolerant Hamiltonicity of twisted cubes
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Matching preclusion and conditional matching preclusion problems for twisted cubes
• Strong matching preclusion

Cited in

(26)

• Matching preclusion number of graphs
• On the global strong resilience of fault Hamiltonian graphs
• Fractional matching preclusion number of graphs
• Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
• The fractional matching preclusion number of complete n-balanced k-partite graphs
• Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number
• Fractional matching preclusion of product networks
• The fractional (strong) matching preclusion number of complete \(k\)-partite graph
• Fractional matching preclusion of the restricted HL-graphs
• Fractional matching preclusion number of graphs and the perfect matching polytope
• Fractional matching preclusion for arrangement graphs
• Conditional fractional matching preclusion of \(n\)-dimensional torus networks
• Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
• Fractional matching preclusion for crossed cubes
• A short note of strong matching preclusion for a class of arrangement graphs
• Fractional matching preclusion for data center networks
• Fractional Strong Matching Preclusion for DHcube
• Fractional matching preclusion for data center networks
• Fractional matching preclusion for (n,k)-star graphs
• Fractional matching preclusion for radix triangular mesh
• Conditional matching preclusion number of graphs
• Fractional matching preclusion numbers of Cartesian product graphs
• Integer \(k\)-matching preclusion of some interconnection networks
• Conditional \(k\)-matching preclusion for \(n\)-dimensional torus networks
• Integer k-matching preclusion of graphs
• Conditional fractional matching preclusion number of graphs

This page was built for publication: Fractional matching preclusion of graphs

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