Fractional matching preclusion of the restricted HL-graphs

DOI10.1007/s10878-019-00441-xzbMath1431.05125OpenAlexW2963008989MaRDI QIDQ2279755

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 perfect matchingrestricted HL-graphsfractional matching preclusion numberfractional strong matching preclusion number

Mathematics Subject Classification ID

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

Related Items (3)

The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ On the global strong resilience of fault Hamiltonian graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong matching preclusion
• On the generalized twisted cube
• Perfect matchings in pruned grid graphs
• Conditional matching preclusion for hypercube-like interconnection networks
• Strong matching preclusion under the conditional fault model
• On \(g\)-extra connectivity of hypercube-like networks
• Fractional matching preclusion of graphs
• Perfect matchings after vertex deletions
• The locally twisted cubes
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• A Hypercube Variant with Small Diameter

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