Matching preclusion for direct product of regular graphs

DOI10.1016/j.dam.2019.08.016zbMath1435.05163OpenAlexW2974609567MaRDI QIDQ2306600

Weisheng Zhao, Heping Zhang, Ruizhi Lin

Publication date: 23 March 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.08.016

zbMATH Keywords

regular graphstrong productdirect productmatching preclusionmaximally matchedsuper matched

Mathematics Subject Classification ID

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

Related Items (5)

The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ 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

Uses Software

• KronFit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching preclusion for vertex-transitive networks
• Some remarks on the Kronecker product of graphs
• A characterization of the edge connectivity of direct products of graphs
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• Matching preclusion for \(k\)-ary \(n\)-cubes
• On some topological indices of the tensor products of graphs
• Matching theory
• Matching preclusion for balanced hypercubes
• Connectivity of strong products of graphs
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion for cube-connected cycles
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• The (conditional) matching preclusion for burnt pancake graphs
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Hamiltonian decompositions of strong products
• Upper bounds on the bondage number of the strong product of a graph and a tree
• TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY
• Edge-connectivity of strong products of graphs
• Hamiltonian decompositions of products of cycles

This page was built for publication: Matching preclusion for direct product of regular graphs