Matching preclusion number in product graphs
type: Item
instance of: scholarly article
title: Matching preclusion number in product graphs
zbMATH Open document ID: 1416.05242
author: Zhao Wang
author: Christopher Melekian
author: Eddie Cheng
author: Yaping Mao
published in: Theoretical Computer Science
publication date: 2019-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7023761
zbMATH Keywords: interconnection networks
zbMATH Keywords: perfect matching
zbMATH Keywords: matching preclusion
zbMATH Keywords: Cartesian product
zbMATH Keywords: lexicographic product
zbMATH Keywords: direct product
zbMATH Keywords: strong product
zbMATH Keywords: join
zbMATH Keywords: cluster
zbMATH Keywords: corona
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.06.050
OpenAlex ID: W2852843876
cites work: Comparative study of product networks
cites work: Q5422499
cites work: Q3378287
cites work: \(\{2,3\}\)-extraconnectivities of hypercube-like networks
cites work: Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
cites work: Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
cites work: Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
cites work: MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
cites work: Matching preclusion for some interconnection networks
cites work: Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
cites work: Robust recoverable perfect matchings
cites work: Q3005852
cites work: Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
cites work: Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
cites work: Matching preclusion for \(n\)-dimensional torus networks
cites work: Fault-tolerant path embedding in folded hypercubes with both node and edge faults
cites work: Matching preclusion for vertex-transitive networks
cites work: Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
cites work: Matching preclusion for balanced hypercubes
cites work: Conditional matching preclusion for hypercube-like interconnection networks
cites work: Matching preclusion for \(k\)-ary \(n\)-cubes
DOI: 10.1016/J.TCS.2018.06.050
description: scientific article; zbMATH DE number 7023761