The extendability of Cayley graphs generated by transpositions
From MaRDI portal
Publication:6180652
Recommendations
Cites work
- scientific article; zbMATH DE number 4066957 (Why is no real title available?)
- scientific article; zbMATH DE number 166089 (Why is no real title available?)
- scientific article; zbMATH DE number 1286491 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- A walk through combinatorics. An introduction to enumeration and graph theory
- Classifying 2-extendable generalized Petersen graphs
- Extendability and criticality in matching theory
- Fault resiliency of Cayley graphs generated by transpositions
- Matching extendability and connectivity of regular graphs from eigenvalues
- Matching extension in prism graphs
- Max-cut and extendability of matchings in distance-regular graphs
- New methods for using Cayley graphs in interconnection networks
- N‐extendability of symmetric graphs
- On 2-extendable abelian Cayley graphs
- On extendability of Cayley graphs
- On extendability of Deza graphs with diameter 2
- On extendability of co-edge-regular graphs
- On n-extendable graphs
- On the 2-extendability of the generalized Petersen graphs
- On the extendability of semi-Cayley graphs of finite abelian groups.
- Reliability analysis of Cayley graphs generated by transpositions
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The 2-extendability of strongly regular graphs
- The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
- The extendability of matchings in strongly regular graphs
- The matching extension problem in general graphs is co-NP-complete
This page was built for publication: The extendability of Cayley graphs generated by transpositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180652)