CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS

DOI10.1142/S0129626413500047zbMath1284.68451MaRDI QIDQ5408359

László Lipták, Eddie Cheng

Publication date: 10 April 2014

Published in: Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

interconnection networksperfect matchings\((n, k)\)-star graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Mathematical problems of computer architecture (68M07)

Related Items (3)

Fractional Matching Preclusion for (n,k)-Star Graphs ⋮ A complete classification of which \((n,k)\)-star graphs are Cayley graphs ⋮ Fractional matching preclusion for radix triangular mesh

Cites Work

• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• The \((n,k)\)-star graph: A generalized star graph
• 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
• Matching preclusion for some interconnection networks

This page was built for publication: CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS