Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 10, No 2 (2022): Electronic Journal of Graph Theory and Applications

Perfect matching transitivity of circulant graphs.

Isaac Armando Reiter (Kutztown University of Pennsylvania, Kutztown, PA)
Ju Zhou (Kutztown University of Pennsylvania, Kutztown, PA)

Article Info

Publish Date
29 Oct 2022

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.

Copyrights © 2022




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...