|
Gracefulness of Unconnected Graphs(P1∨Pn)∪Gr,(P1∨Pn)∪(P3∨r) and Wn∪St(m)
CAI Hua, WEI Lixia, LV Xianrui
J4. 2007, 45 (04):
539-543.
The present paper deals with the gracefulness of three kinds of unconnected graphs ((P1∨Pn)∪Gr,(P1∨Pn)∪(P3∨r) and Wn∪St(m), and proves the following results: for positive integers n and m, let s=[n/2], r=s-1, Gr be a graceful graph with redges, if n≥4, then the unconnected graphs (P1∨Pn)∪Gr,(P1∨Pn)∪(P3∨r) are both graceful graphs; if n≥3andm≥s, then the unconnected graph Wn∪St(m) is a graceful graph, where Pn is
an nvertex path, Kn is an nvertex complete graph, nis the complement
of graph Kn, graph G1∨G2 is the join graph of G1 and G2, Wnis an (n+1)vertex wheel graph and St(m)is an (m+1) vertex star tree.
Related Articles |
Metrics
|