| 关于P_(r,(2s-1))的奇优美标号 |
| |
| 引用本文： | 李武装,严谦泰.关于P_(r,(2s-1))的奇优美标号[J].数学的实践与认识,2011,41(16). |
| |
| 作者姓名： | 李武装 严谦泰 |
| |
| 作者单位： | 1. 安阳师范学院公共计算机教学部,河南安阳,455002
2. 安阳师范学院数学与统计学院,河南安阳,455002 |
| |
| 摘 要： | 对于简单图G=〈V,E〉,如果存在一个映射f:V(G)→{0,1,2,…,2 |E|-1}满足1)对任意的u,v∈V,若u≠v,则(u)≠f(v);2)max{f(v)|v∈V}=2|E|-1;3)对任意的e_1,e_2∈E,若e_1≠e_2,则g(e_1)≠g(e_2),此处g(e)=|f(u)+f(v)|,e=uv;4){g(e)|e∈E}={1,3,5,…,2|E|-1},则称G是奇优美图,f称为G的奇优美标号.Gnanajoethi提出了一个猜想:每棵树都是奇优美的.证明了图P_(r,(2s-1)是奇优美图.
|
| 关 键 词： | 奇优美图 奇优美标号 图P_r (2s-1) |
Odd Graceful Labeling of Graph Pr,(2s-1) |
| |
| LI Wu-zhuang,YAN Qian-tai.Odd Graceful Labeling of Graph Pr,(2s-1)[J].Mathematics in Practice and Theory,2011,41(16). |
| |
| Authors: | LI Wu-zhuang YAN Qian-tai |
| |
| Institution: | LI Wu-zhuang~1,YAN Qian-tai~2 (1.Public Teaching Department of Computer,Anyang Normal University,Anyang 455002,China) (2.CoOege of Mathematics and Statistics,China) |
| |
| Abstract: | Let G=〈V,E〉be a simple graph.If there exist a mapping f:V(G)→{0,1,2,…,2 |E|-1} satisfied 1)u,v∈V,if u≠v,then f(u)≠f(v);2) max{/(v) |v∈V}= 2 |E| -1;3)e_1,e_2∈E,if e_1≠e_2,then g(e_1)≠g(e_2),where g(e) = |f(u) + f(v)|,e=uv;4) {g(e) |e∈E} = {1,3,5,…,2 |E|-1},then G is called odd graceful graph,f is called odd graceful labeling of G.Mr.Gnanajoethiproposed a conjecture that every tree is odd graceful. In this paper,we proved that graph P_(r,(2s-1)) are odd graceful graphs. |
| |
| Keywords: | odd graceful graph odd graceful labeling graph P_(r (2s-1)) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
