Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars

DOI10.1002/net.20441zbMath1248.05155OpenAlexW2021409173MaRDI QIDQ2913948

Philip Hu, Roger Jia, László Lipták, Eddie Cheng

Publication date: 21 September 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/91319

zbMATH Keywords

Cayley graphsinterconnection networksperfect matchinghyper-stars

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

Matching preclusion for vertex-transitive networks ⋮ The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Strong matching preclusion for augmented cubes ⋮ Fractional matching preclusion numbers of Cartesian product graphs ⋮ Strong matching preclusion number of graphs ⋮ Strong matching preclusion of \((n,k)\)-star graphs ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ Matching preclusion number of graphs ⋮ The (conditional) matching preclusion for burnt pancake graphs ⋮ Matching preclusion number in product graphs ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS ⋮ Matching preclusion for \(n\)-grid graphs ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ Fractional matching preclusion number of graphs and the perfect matching polytope ⋮ Fractional matching preclusion number of graphs ⋮ Matching preclusion for cube-connected cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional matching preclusion sets
• Linearly many faults in Cayley graphs generated by transposition trees
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
• On the maximal connected component of a hypercube with faulty vertices III
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• On the maximal connected component of hypercube with faulty vertices (II)
• Increasing the connectivity of the star graphs
• On the maximal connected component of hypercube with faulty vertices
• Matching preclusion for some interconnection networks

This page was built for publication: Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars