The extendability of Cayley graphs generated by transpositions
From MaRDI portal
Publication:6180652
DOI10.1016/J.DAM.2023.10.023MaRDI QIDQ6180652FDOQ6180652
Yong-De Feng, Yan-Ting Xie, S. J. Xu
Publication date: 2 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Discrete mathematics in relation to computer science (68Rxx) Graph theory (05Cxx) Algebraic combinatorics (05Exx)
Cites Work
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- A group-theoretic model for symmetric interconnection networks
- On n-extendable graphs
- Title not available (Why is that?)
- New methods for using Cayley graphs in interconnection networks
- Title not available (Why is that?)
- The 2-extendability of strongly regular graphs
- The extendability of matchings in strongly regular graphs
- N‐extendability of symmetric graphs
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- Matching extension in prism graphs
- Max-cut and extendability of matchings in distance-regular graphs
- On 2-extendable abelian Cayley graphs
- On extendability of Deza graphs with diameter 2
- Title not available (Why is that?)
- On extendability of Cayley graphs
- The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
- Classifying 2-extendable generalized Petersen graphs
- On the 2-extendability of the generalized Petersen graphs
- Title not available (Why is that?)
- Matching extendability and connectivity of regular graphs from eigenvalues
- On extendability of co-edge-regular graphs
- The matching extension problem in general graphs is co-NP-complete
- Reliability analysis of Cayley graphs generated by transpositions
- Extendability and criticality in matching theory
- Title not available (Why is that?)
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)
