Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 6, No 2 (2018): Electronic Journal of Graph Theory and Applications

Characterization of perfect matching transitive graphs

Ju Zhou (Department of Mathematics Kutztown University of Pennsylvania Kutztown, PA 19530 USA)

Article Info

Publish Date
10 Oct 2018

Abstract

A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-transitive, verified PM-transitivity of some symmetric graphs, constructed several families of PM-transitive graphs which are neither vertex-transitive nor edge-transitive, and discussed PM-transitivity of generalized Petersen graphs.

Copyrights © 2018




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 ...