Characterization of perfect matching transitive graphs
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-10-10.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 01706 am a22002413u 4500 | ||
|---|---|---|---|
| 001 | EJGTA_583_pdf_87 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Zhou, Ju; Department of Mathematics Kutztown University of Pennsylvania Kutztown, PA 19530 USA |e author |
| 100 | 1 | 0 | |e contributor |
| 245 | 0 | 0 | |a Characterization of perfect matching transitive graphs |
| 260 | |b GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, |c 2018-10-10. | ||
| 500 | |a https://www.ejgta.org/index.php/ejgta/article/view/583 | ||
| 520 | |a 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. | ||
| 540 | |a Copyright (c) 2018 Electronic Journal of Graph Theory and Applications (EJGTA) | ||
| 546 | |a eng | ||
| 690 | |a vertex-transitive, edge-transitive, symmetric, PM-transitive | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |a Peer-reviewed Article |2 local | |
| 786 | 0 | |n Electronic Journal of Graph Theory and Applications (EJGTA); Vol 6, No 2 (2018): Electronic Journal of Graph Theory and Applications; 362-370 | |
| 786 | 0 | |n 2338-2287 | |
| 787 | 0 | |n https://www.ejgta.org/index.php/ejgta/article/view/583/pdf_87 | |
| 856 | 4 | 1 | |u https://www.ejgta.org/index.php/ejgta/article/view/583/pdf_87 |z Get Fulltext |