Perfect matching transitivity of circulant graphs
| Main Authors: | Reiter, Isaac Armando; Kutztown University of Pennsylvania, Kutztown, PA, Zhou, Ju; Kutztown University of Pennsylvania, Kutztown, PA |
|---|---|
| Other Authors: | FPDC Grant, Kutztown University of Pennsylvania |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1564 https://www.ejgta.org/index.php/ejgta/article/view/1564/pdf_238 |
Daftar Isi:
- A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M1 and M2 of G, there is an automorphism f : V(G)↦V(G) such that fe(M1)=M2, where fe(uv)=f(u)f(v). In this paper, the authors completely characterize the perfect matching transitivity of circulant graphs of order less than or equal to 10.