Strong matching preclusion of \((n,k)\)-star graphs
type: Item
instance of: scholarly article
title: Strong matching preclusion of \((n,k)\)-star graphs
zbMATH Open document ID: 1334.05115
author: Eddie Cheng
author: Justin Kelm
author: Joseph Renzi
published in: Theoretical Computer Science
publication date: 2016-01-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6534138
zbMATH Keywords: perfect matching
zbMATH Keywords: almost perfect matching
zbMATH Keywords: \((n, k)\)-star graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.11.051
OpenAlex ID: W2264766799
cites work: Q3378287
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: Conditional matching preclusion sets
cites work: Matching preclusion for some interconnection networks
cites work: Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
cites work: Q3544998
cites work: The (conditional) matching preclusion for burnt pancake graphs
cites work: Conditional fault hamiltonian connectivity of the complete graph
cites work: Conditional fault Hamiltonicity of the complete graph
cites work: Conditional matching preclusion for hypercube-like interconnection networks
cites work: Strong matching preclusion
cites work: Strong matching preclusion for \(k\)-ary \(n\)-cubes
cites work: Matching preclusion for \(k\)-ary \(n\)-cubes
DOI: 10.1016/J.TCS.2015.11.051
description: scientific article; zbMATH DE number 6534138