摘要
Frucht 与 Salinas 于1985年猜测图 C_m ∪ P_n 优美当且仅当 m+n≥7,而他们仅证明了图 C_4 ∪P_n(n≥3)的优美性.本文对图 C_4 ∪ P_n 的任意 k- 优美性给予证实.
In 1985,Frucht and Salinas conjectured that graph C_m∪P_n is graceful if and only if m+n≥7,but they have only proved the gracefulness of graph C4∪P,(n≥3).In this paper the any k-gracefulness of graph C_4∪P_n(n≥3)is proved.
