Abstract
A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M 1 and M 2 of G , there is an automorphism f : V ( G )↦ V ( G ) such that f e ( M 1 )= M 2 , where f e ( u v )= 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Electronic Journal of Graph Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.