A short note of strong matching preclusion for a class of arrangement graphs
From MaRDI portal
Publication:5087067
DOI10.1142/S0129626420500012zbMATH Open1490.05225OpenAlexW3011151634MaRDI QIDQ5087067FDOQ5087067
Authors:
Publication date: 8 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626420500012
Recommendations
Cites Work
- Graph theory
- Arrangement graphs: A class of generalized star graphs
- A new class of interconnection networks based on the alternating group
- Title not available (Why is that?)
- Matching preclusion for some interconnection networks
- Strong matching preclusion
- Matching preclusion for vertex-transitive networks
- Conditional matching preclusion sets
- Conditional matching preclusion for the arrangement graphs
- MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
- Strong matching preclusion number of graphs
- Strong matching preclusion of 2-matching composition networks
- Fractional matching preclusion of graphs
- Fractional matching preclusion for arrangement graphs
Cited In (6)
- Conditional strong matching preclusion of the alternating group graph
- Strong matching preclusion
- Strong matching preclusion for \(k\)-composition networks
- Strong matching preclusion number of graphs
- Matching preclusion for the (n, k)-bubble-sort graphs
- A note on the strong matching preclusion problem for data center networks
This page was built for publication: A short note of strong matching preclusion for a class of arrangement graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087067)
