A note on characterization of the induced matching extendable Cayley graphs generated by transpositions
From MaRDI portal
Publication:2700615
DOI10.1016/j.dam.2023.03.006OpenAlexW4327905093MaRDI QIDQ2700615
Shou-Jun Xu, Yan-Ting Xie, Yong-De Feng, Lina Wei
Publication date: 27 April 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.006
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Induced matching extendable graph powers
- On n-extendable graphs
- New methods for using Cayley graphs in interconnection networks
- Induced matchings
- Characterization of the induced matching extendable graphs with \(2 n\) vertices and \(3 n\) edges
- Reliability analysis of Cayley graphs generated by transpositions
- 4-regular claw-free IM-extendable graphs
- Distance matching extension in cubic bipartite graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- A group-theoretic model for symmetric interconnection networks
- Maximal IM-unextendable graphs
This page was built for publication: A note on characterization of the induced matching extendable Cayley graphs generated by transpositions