ARTICLE
TITLE

Characterization of perfect matching transitive graphs

Ju Zhou  

SUMMARY

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.

PAGES
pp. 362 - 370

 Articles related

Grace Purnamasari Christian,Wahyu Irawati    

The post-harvest fungi is one of the greatest cause of various diseases. Particularly, in fungus that infects seeds, the toxic substance called aflatoxin is found. This has caused us to wonder: Has fungi been pathogenic fungi since the beginning of creat... see more


T. Baiju, Sunil Jacob John    

In this paper we introduce the concept of Para-Lindelof spaces in L-topological spaces by means of locally countable families of L-fuzzy sets. Further some characterizations of fuzzy para-Lindelofness and flintily para-Lindelofness in the weakly induced ... see more

Revista: Proyecciones

T. Baiju, Sunil Jacob John    

In this paper the concept of finitistic spaces in L-topological spaces is introduced by means of a-Q-covers of open L subsets. Also a characterization of finitistic spaces in the weakly induced L-topological spaces is obtained. Moreover the behavior of f... see more

Revista: Proyecciones

Romeo Rizzi    

A simple graph is P4-indifferent if it admits a total order < onits nodes such that every chordless path with nodes a, b, c, d and edgesab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize indifferent graph... see more