Conditional matching preclusion for the arrangement graphs

DOI10.1016/J.TCS.2011.07.007zbMATH Open1234.68322OpenAlexW2047201685MaRDI QIDQ653318FDOQ653318

Authors Eddie Cheng, Marc J. Lipman, L. Lipták, David Sherman 

Publication date 9 January 2012

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

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

zbMATH Keywords

interconnection networksmatching preclusion number of a graph

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) Network design and communication in computer systems (68M10)

Recommendations

• Conditional matching preclusion sets
• Conditional matching preclusion for the star graphs.
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
• Matching preclusion for some interconnection networks

Cites Work

• scientific article; zbMATH DE number 5016662 (Why is no real title available?)
• scientific article; zbMATH DE number 1185932 (Why is no real title available?)
• scientific article; zbMATH DE number 3390835 (Why is no real title available?)
• A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
• A new class of interconnection networks based on the alternating group
• A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem
• Arrangement graphs: A class of generalized star graphs
• Conditional matching preclusion for hypercube-like interconnection networks
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Conditional matching preclusion sets
• Embedding longest fault-free paths in arrangement graphs with faulty vertices
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Embedding of cycles in arrangement graphs
• Improved deterministic algorithms for weighted matching and packing problems
• Longest fault-free paths in star graphs with vertex faults
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Matching preclusion for some interconnection networks
• On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs
• On the arrangement graph.
• On the surface area of the \((n,k)\)-star graph
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• Strong matching preclusion
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs

Cited In (30)

• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• Fault tolerance in the arrangement graphs
• Conditional matching preclusion sets
• Conditional matching preclusion for hypercube-like interconnection networks
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Subnetwork reliability of the arrangement graphs under probabilistic fault condition
• Generalized Matching Preclusion in Bipartite Graphs
• Strong matching preclusion for augmented cubes
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Conditional matching preclusion for regular bipartite graphs and their Cartesian product
• Fractional matching preclusion for arrangement graphs
• Path and cycle fault tolerance of bubble-sort graph networks
• Conditional matching preclusion for the star graphs.
• The symmetry property of (n,k)‐arrangement graph
• Matching preclusion for balanced hypercubes
• CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
• Matching preclusion for \(n\)-grid graphs
• Fractional matching preclusion of product networks
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Matching preclusion for cube-connected cycles
• Conditional matching preclusion number of graphs
• Cayley graph on symmetric group generated by elements fixing \(k\) points
• The (conditional) matching preclusion for burnt pancake graphs
• Strong matching preclusion number of graphs
• On the eigenvalues of certain Cayley graphs and arrangement graphs
• Integer \(k\)-matching preclusion of graphs
• A short note of strong matching preclusion for a class of arrangement graphs
• Matching preclusion for the (n, k)-bubble-sort graphs
• Link failure tolerance in the arrangement graphs
• Title not available (Why is no real title available?)

This page was built for publication: Conditional matching preclusion for the arrangement graphs

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