Strong matching preclusion number of graphs
type: Item
instance of: scholarly article
title: Strong matching preclusion number of graphs
zbMATH Open document ID: 1387.05209
author: Yaping Mao
author: Zhao Wang
author: Eddie Cheng
author: Christopher Melekian
published in: Theoretical Computer Science
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6834898
zbMATH Keywords: interconnection networks
zbMATH Keywords: perfect matching
zbMATH Keywords: strong matching preclusion number
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.12.035
OpenAlex ID: W2781705660
Wikidata QID: Q56638368
cites work: A survey of Nordhaus-Gaddum type relations
cites work: Q3258698
cites work: Q5422499
cites work: Q3378287
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 some interconnection networks
cites work: Matching preclusion and conditional matching preclusion for regular interconnection networks
cites work: Conditional matching preclusion for the arrangement graphs
cites work: Matching preclusion for the (n, k)-bubble-sort graphs
cites work: Q3015671
cites work: Strong matching preclusion of \((n,k)\)-star graphs
cites work: Strong matching preclusion for augmented cubes
cites work: Q3544998
cites work: On the NP-completeness of the perfect matching free subgraph problem
cites work: Note on Hamilton Circuits
cites work: Strong matching preclusion
cites work: Strong matching preclusion under the conditional fault model
cites work: Conditional matching preclusion for hypercube-like interconnection networks
cites work: The Factorization of Linear Graphs
cites work: Matching preclusion for \(k\)-ary \(n\)-cubes
cites work: Strong matching preclusion for \(k\)-ary \(n\)-cubes
DOI: 10.1016/J.TCS.2017.12.035
description: scientific article; zbMATH DE number 6834898