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

DOI10.1080/00207160902883514MaRDI QIDQ3056376zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, L. Lipták, David 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

\((n, k)\)-bubble-sort graphsCayley graphsHamiltonianinterconnection networksperfect matching

Mathematics Subject Classification ID

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

Recommendations

• Conditional matching preclusion for bubble sort graphs
• Conditional matching preclusion of the modified bubble sort graph
• Conditional matching preclusion sets for an mixed-graph of the star graph and the bubble-sort graph
• The (n,k)-bubble sort graphs
• Generalized Matching Preclusion in Bipartite Graphs
• Conditional matching preclusion for the arrangement graphs
• A note on generalized matching preclusion in bipartite graphs
• Matching preclusion for n-grid graphs
• scientific article; zbMATH DE number 5919743
• A short note of strong matching preclusion for a class of arrangement graphs

Cites work

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

Cited in

(19)

• Strong matching preclusion number of graphs
• Matching preclusion number of graphs
• Matching preclusion for n-grid graphs
• Strong matching preclusion under the conditional fault model
• Vertex-pancyclicity of the \((n,k)\)-bubble-sort networks
• Fractional matching preclusion number of graphs
• The (strong) structure connectivity and (strong) substructure connectivity of the \(( n , k )\)-bubble-sort network
• Matching preclusion for cube-connected cycles
• Matching preclusion for \(n\)-dimensional torus networks
• Matching preclusion for vertex-transitive networks
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
• Conditional matching preclusion for bubble sort graphs
• scientific article; zbMATH DE number 5919743 (Why is no real title available?)
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Fractional matching preclusion for radix triangular mesh
• On strong Menger connectivity of \((n,k)\)-bubble-sort networks
• Conditional fractional matching preclusion number of graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of (n, k)-bubble sort graphs
• The component reliability of regular interconnection networks

Describes a project that uses

Uses Software

• Concorde

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056376)