Matching preclusion for the (n, k)-bubble-sort graphs

DOI10.1080/00207160902883514zbMath1198.05123OpenAlexW1973902190MaRDI QIDQ3056376

László Lipták, Eddie Cheng, David J. Sherman

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160902883514

zbMATH Keywords

HamiltonianCayley graphsinterconnection networksperfect matching\((n, k)\)-bubble-sort graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (14)

Matching preclusion for vertex-transitive networks ⋮ The (strong) structure connectivity and (strong) substructure connectivity of the \(( n , k )\)-bubble-sort network ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions ⋮ On strong Menger connectivity of \((n,k)\)-bubble-sort networks ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion under the conditional fault model ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Matching preclusion number of graphs ⋮ Matching preclusion for \(n\)-grid graphs ⋮ Fractional matching preclusion for radix triangular mesh ⋮ Vertex-pancyclicity of the \((n,k)\)-bubble-sort networks ⋮ Fractional matching preclusion number of graphs ⋮ Matching preclusion for cube-connected cycles ⋮ Matching preclusion for \(n\)-dimensional torus networks

Uses Software

• Concorde

Cites Work

• Orienting Cayley graphs generated by transposition trees
• The \((n,k)\)-star graph: A generalized star graph
• FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
• Integer Programming Formulation of Traveling Salesman Problems
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Matching preclusion for some interconnection networks

This page was built for publication: Matching preclusion for the (n, k)-bubble-sort graphs