Characterization of perfect matching transitive graphs
| Main Author: | Zhou, Ju; Department of Mathematics Kutztown University of Pennsylvania Kutztown, PA 19530 USA |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2018
|
| Subjects: | |
| Online Access: |
http://www.ejgta.org/index.php/ejgta/article/view/583 http://www.ejgta.org/index.php/ejgta/article/view/583/pdf_87 |
Daftar Isi:
- 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.