Fractional matching preclusion of the restricted HL-graphs

DOI10.1007/S10878-019-00441-XMaRDI QIDQ2279755zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 December 2019

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

Full work available at URL https://doi.org/10.1007/s10878-019-00441-x

zbMATH Keywords

fractional matching preclusion numberfractional perfect matchingfractional strong matching preclusion numberrestricted HL-graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Fractional matching preclusion for arrangement graphs
• Fractional matching preclusion of graphs
• Fractional matching preclusion number of graphs and the perfect matching polytope
• Fractional matching preclusion number of graphs
• Fractional Matchings of Graphs
• Fractional matchings in hypergraphs
• Fractional matching preclusion for (n,k)-star graphs
• The fractional (strong) matching preclusion number of complete \(k\)-partite graph
• Fractional matching preclusion numbers of Cartesian product graphs
• The fractional matching numbers of graphs

Cites work

• A hypercube variant with small diameter
• Conditional matching preclusion for hypercube-like interconnection networks
• Fractional matching preclusion of graphs
• Graph theory
• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• On \(g\)-extra connectivity of hypercube-like networks
• On the generalized twisted cube
• Perfect matchings after vertex deletions
• Perfect matchings in pruned grid graphs
• Strong matching preclusion
• Strong matching preclusion under the conditional fault model
• The locally twisted cubes

Cited in

(7)

• On the global strong resilience of fault Hamiltonian graphs
• Fractional matching preclusion number of graphs
• The fractional matching preclusion number of complete n-balanced k-partite graphs
• The fractional (strong) matching preclusion number of complete \(k\)-partite graph
• Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
• Fractional Strong Matching Preclusion for DHcube
• Fractional strong matching preclusion for two variants of hypercubes

This page was built for publication: Fractional matching preclusion of the restricted HL-graphs

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