MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
DOI10.1142/S0129054108006364zbMATH Open1175.68287MaRDI QIDQ3606558FDOQ3606558
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)
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
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)
Cites Work
- Arrangement graphs: A class of generalized star graphs
- A new class of interconnection networks based on the alternating group
- Matching preclusion for some interconnection networks
- The number of labeled k-dimensional trees
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- Properties and characterizations of k ‐trees
Cited In (30)
- Conditional matching preclusion for the arrangement graphs
- Fractional matching preclusion number of graphs
- Conditional matching preclusion sets
- 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 strong matching preclusion of the alternating group graph
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Strong matching preclusion of \((n,k)\)-star graphs
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for data center networks
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- Fractional matching preclusion for arrangement graphs
- Conditional fault tolerance in a class of Cayley graphs
- Matching preclusion number of graphs
- 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
- Combinatorial analysis of the subsystem reliability of the split-star network
- Matching preclusion and conditional matching preclusion for crossed cubes
- Note on matching preclusion number of random graphs
- Fractional matching preclusion for radix triangular mesh
- Fractional Strong Matching Preclusion for DHcube
- A note on the matching preclusion number of Caylay graphs on abelian groups with given degree
- Integer \(k\)-matching preclusion of graphs
- A short note of strong matching preclusion for a class of arrangement 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
- Matching preclusion number in product 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)
