A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs

DOI10.1142/S0129626420500012zbMath1490.05225OpenAlexW3011151634MaRDI QIDQ5087067

No author found.

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

zbMATH Keywords

matchingstrong matching preclusionmatching preclusionarrangement graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching preclusion for vertex-transitive networks
• Conditional matching preclusion for the arrangement graphs
• Strong matching preclusion
• Conditional matching preclusion sets
• Arrangement graphs: A class of generalized star graphs
• Strong matching preclusion number of graphs
• Fractional matching preclusion for arrangement graphs
• Fractional matching preclusion of graphs
• MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
• A new class of interconnection networks based on the alternating group
• Matching preclusion for some interconnection networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs