Strong matching preclusion of \((n,k)\)-star graphs

DOI10.1016/j.tcs.2015.11.051zbMath1334.05115OpenAlexW2264766799MaRDI QIDQ906391

Joseph Renzi, Justin Kelm, Eddie Cheng

Publication date: 21 January 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.051

zbMATH Keywords

perfect matchingalmost perfect matching\((n, k)\)-star graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

Strong matching preclusion for \(n\)-dimensional torus networks ⋮ Strong matching preclusion for non-bipartite torus networks ⋮ Fractional Matching Preclusion for (n,k)-Star Graphs ⋮ Strong matching preclusion number of graphs ⋮ Subnetwork Preclusion of (n,k)-Star Networks ⋮ Strong matching preclusion for \(k\)-composition networks ⋮ A note on the strong matching preclusion problem for data center networks ⋮ A complete classification of which \((n,k)\)-star graphs are Cayley graphs ⋮ Fractional matching preclusion for radix triangular mesh ⋮ The \(g\)-good-neighbor diagnosability of \((n,k)\)-star graphs ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Strong matching preclusion
• Conditional fault Hamiltonicity of the complete graph
• Conditional fault hamiltonian connectivity of the complete graph
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• The (conditional) matching preclusion for burnt pancake graphs
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Matching preclusion for some interconnection networks

This page was built for publication: Strong matching preclusion of \((n,k)\)-star graphs