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: | Zhou, Ju; Department of Mathematics Kutztown University of Pennsylvania Kutztown, PA 19530 USA (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!
|
Similar Items
-
Perfect codes in some products of graphs
by: Bakaein, Samane; Department of Applied Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, et al.
Published: (2021) -
Perfect 3-colorings of the cubic graphs of order 10
by: Alaeiyan, Mehdi; School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran, et al.
Published: (2017) -
Rainbow perfect domination in lattice graphs
by: Fuentes, Luis R.; University of Puerto Rico Rio Piedras, PR 0936-8377 Puerto Rico, et al.
Published: (2018) -
On the spectrum of a class of distance-transitive graphs
by: Mirafzal, Seyed Morteza; Department of Mathematics Lorestan University, Khoramabad, Iran, et al.
Published: (2017) -
Efficient maximum matching algorithms for trapezoid graphs
by: Do, Phan-Thuan; Department of Computer Science, Hanoi University of Science and Technology, Vietnam, et al.
Published: (2017)