两类大龙虾幸福树的构造性证明Constructive Proof of Two Classes of Felicitous Big Lobster Trees
王鸿,韩培友
摘要(Abstract):
树 T称为幸福树 ,如果存在用集合 { 0 ,1,… ,|E(T) |}中的不同整数分配给它的顶点的一个标号 l,使得由l′(e) =l(u) +l(v) mod|E(T) |定义的导出边标号 l′分配给各条边以不同的标号 .构造性地证明了两类大龙虾树是幸福树 ,并提出了任意龙虾树是幸福树的猜想 .
关键词(KeyWords): 树;幸福树;幸福标号;导出图
基金项目(Foundation):
作者(Author): 王鸿,韩培友
参考文献(References):
- [1] Rosa A.On certain valuations of the vertices of a graph [C].See:Theory of Graphs(Int Symp Rome,July196 6 ) .Gordon and Breach,New York,196 7.34 9~ 35 5 .
- [2 ] Berm ond JC.Graceful graphs,radio antennae and French windm ills[C].See:Graph Theory and Combinatories.Pitm an L ondon,1979.13~ 37.
- [3] Sin- Min L ee,Schmeichel E,Shee S C.On felicitous graphs[J].Discrete Mathematics,1991,93:2 0 1~ 2 0 9.
- [4] Grace T.On sequential labelling of graph[J].JGraph Theory,1983,7:195~ 2 0 1.