MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS

DOI10.1142/S0129054108006364MaRDI QIDQ3606558zbMATH OpenFDO

Authors Eddie Cheng, Linda Lesniak, Marc J. Lipman, L. Lipták

Publication date 26 February 2009

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054108006364

zbMATH Keywords

Cayley graphsinterconnection networksperfect matching

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) 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 the alternating group graphs and Split-stars
• Conditional strong matching preclusion of the alternating group graph
• A note on the matching preclusion number of Caylay graphs on abelian groups with given degree
• Conditional matching preclusion for the arrangement graphs
• Matching preclusion for some interconnection networks

Cites work

• A new class of interconnection networks based on the alternating group
• Arrangement graphs: A class of generalized star graphs
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• Matching preclusion for some interconnection networks
• Properties and characterizations of k ‐trees
• The number of labeled k-dimensional trees

Cited in

(31)

• Conditional matching preclusion sets
• Matching preclusion number of graphs
• Matching preclusion number in product graphs
• Matching preclusion for n-grid graphs
• Fractional matching preclusion number of graphs
• Fractional matching preclusion of product networks
• Fractional matching preclusion for arrangement graphs
• Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Conditional fault tolerance in a class of Cayley graphs
• 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
• Conditional matching preclusion for the alternating group graphs and Split-stars
• Matching preclusion and conditional matching preclusion for crossed cubes
• Matching preclusion and conditional matching preclusion for regular interconnection networks
• Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
• A note on the matching preclusion number of Caylay graphs on abelian groups with given degree
• Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
• A short note of strong matching preclusion for a class of arrangement graphs
• Fractional matching preclusion for data center networks
• Fractional Strong Matching Preclusion for DHcube
• Fractional matching preclusion for data center networks
• Fractional matching preclusion for radix triangular mesh
• Conditional strong matching preclusion of the alternating group graph
• CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
• Conditional matching preclusion for the arrangement graphs
• Integer k-matching preclusion of graphs
• Conditional fractional matching preclusion number of graphs
• Combinatorial analysis of the subsystem reliability of the split-star network
• Note on matching preclusion number of random graphs
• Strong matching preclusion of (n,k)-star graphs

This page was built for publication: MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS

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