Isaac Armando Reiter
Kutztown University of Pennsylvania, Kutztown, PA

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Perfect matching transitivity of circulant graphs. Isaac Armando Reiter; Ju Zhou
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 10, No 2 (2022): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2022.10.2.14

Abstract

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.