|
|||||
|
|
| 关于p3n的优美性 | |
| 引用本文： | 严谦泰,张忠辅. 关于p3n的优美性[J]. 数学研究与评论, 2004, 24(2) |
| 作者姓名： | 严谦泰 张忠辅 |
| 摘 要： | 设G(V,E)是一个简单图,对自然数k,当V(Gk)=V(G),E(Gk)=E(G)∪{uv|d(u,v)=k},则称图Gk为k-次方图.本文证明了图P3n的优美性. |
| 关 键 词： | p3n图 优美标号 优美图 |
p3n is a Graceful Graph |
|
| Abstract: | Let G(V,E) be a simple graph and Gk be a k-power graph defined by V(Gk) = V(G), E(Gk) = E(G) ∪ {uv|d(u, v) = k} for natural number k. In this paper,it is proved that pn3 is a graccful graph. |
| Keywords: | graph P,p3n graceful labelling graceful graph |
| 本文献已被 万方数据 等数据库收录！ | |