The Gracefulness of Unconnected Graphs (P3∨Km)∪G及(C3∨Km)∪G
返回论文页
|更新时间:2023-12-11
|
The Gracefulness of Unconnected Graphs (P3∨Km)∪G及(C3∨Km)∪G
Acta Scientiarum Naturalium Universitatis SunYatseniVol. 51, Issue 5, Pages: 54-57(2012)
作者机构:
1. 华北科技学院基础部,河北,三河,065201
2. 首都师范大学数学系,北京,100048
作者简介:
基金信息:
DOI:
CLC:
Published:2012,
Published Online:25 September 2012,
扫 描 看 全 文
WANG Tao, WANG Qing, LI Deming. The Gracefulness of Unconnected Graphs (P3∨Km)∪G及(C3∨Km)∪G. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(5):54-57(2012)
DOI:
WANG Tao, WANG Qing, LI Deming. The Gracefulness of Unconnected Graphs (P3∨Km)∪G及(C3∨Km)∪G. [J]. Acta Scientiarum Naturalium Universitatis SunYatseni 51(5):54-57(2012)DOI:
The Gracefulness of Unconnected Graphs (P3∨Km)∪G及(C3∨Km)∪G
The definition of k-graceful graph is extended and the new concept of A~B graceful graph is presented.One sufficient condition about determining the gracefulness of unconnected graph
(P
3
m
3
m
is obtained.In the meanwhile
it is proved that for any natural numbers
k
m
n
t
which are not less than one
when k≤n≤t and n+k-1≤m
the disconnected graphs
(P
3
m
k
j=1
K
n
t
) and
(C
3
m
k
j=1
K
n
t
) are graceful; when k=1
2
2≤n
<
2m+1 the graphs (P
3
∨K
m
)∪
k
∪
j=1
P
n
(C
3
∨K
m
)∪
k
∪
j=1
P
n
and (P
3
∨K
m
)∪ P
n
∪St(t) are graceful; when 2≤n≤2m+1
the graphs (P
3
∨K
m
)∪ P
n
∪St(t) are graceful. Results generalize some of the known results.