Matching preclusion number in product graphs

DOI10.1016/j.tcs.2018.06.050zbMath1416.05242OpenAlexW2852843876MaRDI QIDQ1725689

Christopher Melekian, Eddie Cheng, Zhao Wang, Yaping Mao

Publication date: 14 February 2019

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

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

zbMATH Keywords

clustercoronajoininterconnection networksCartesian productperfect matchingstrong productdirect productlexicographic productmatching preclusion

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (10)

Construction of k-matchings in graph products ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Conditional matching preclusion number of graphs ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Fractional matching preclusion of product networks ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ Conditional matching preclusion for regular bipartite graphs and their Cartesian product ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ A note on maximum fractional matchings of graphs ⋮ Fractional matching preclusion number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching preclusion for vertex-transitive networks
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional matching preclusion for hypercube-like interconnection networks
• Comparative study of product networks
• Matching preclusion for balanced hypercubes
• Fault-tolerant path embedding in folded hypercubes with both node and edge faults
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion for \(n\)-dimensional torus networks
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• 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 ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Robust recoverable perfect matchings
• Matching preclusion for some interconnection networks

This page was built for publication: Matching preclusion number in product graphs