Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

On Lee's conjecture and some results

Lixia FanZhihe Liang — 2009

Discussiones Mathematicae Graph Theory

S.M. Lee proposed the conjecture: for any n > 1 and any permutation f in S(n), the permutation graph P(Pₙ,f) is graceful. For any integer n > 1 and permutation f in S(n), we discuss the gracefulness of the permutation graph P(Pₙ,f) if f = k = 0 l - 1 ( m + 2 k , m + 2 k + 1 ) , and k = 0 l - 1 ( m + 4 k , m + 4 k + 2 ) ( m + 4 k + 1 , m + 4 k + 3 ) for any positive integers m and l.

Page 1

Download Results (CSV)