Strong matching preclusion number of graphs

DOI10.1016/j.tcs.2017.12.035zbMath1387.05209OpenAlexW2781705660WikidataQ56638368 ScholiaQ56638368MaRDI QIDQ1694672

Eddie Cheng, Yaping Mao, Zhao Wang, Christopher Melekian

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.035

zbMATH Keywords

interconnection networksperfect matchingstrong matching preclusion number

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs ⋮ Fractional Matching Preclusion for (n,k)-Star Graphs ⋮ Conditional matching preclusion number of graphs ⋮ A note on the strong matching preclusion problem for data center networks ⋮ Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract) ⋮ Fractional matching preclusion of product networks ⋮ Matching preclusion number of graphs ⋮ Fractional matching preclusion for radix triangular mesh ⋮ Fractional matching preclusion number of graphs ⋮ Fractional matching preclusion for arrangement graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong matching preclusion for augmented cubes
• On the NP-completeness of the perfect matching free subgraph problem
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional matching preclusion for the arrangement graphs
• Strong matching preclusion
• Strong matching preclusion of \((n,k)\)-star graphs
• Conditional matching preclusion for hypercube-like interconnection networks
• A survey of Nordhaus-Gaddum type relations
• Strong matching preclusion under the conditional fault model
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
• Matching preclusion for the (n, k)-bubble-sort graphs
• Note on Hamilton Circuits
• Matching preclusion for some interconnection networks
• The Factorization of Linear Graphs

This page was built for publication: Strong matching preclusion number of graphs