| 直径为4的树的奇强协调性 |
| |
| 引用本文： | 冉红,李武装.直径为4的树的奇强协调性[J].数学的实践与认识,2007,37(12):133-136. |
| |
| 作者姓名： | 冉红 李武装 |
| |
| 作者单位： | 1. 安阳工学院,河南,安阳,455000
2. 安阳师范学院,河南,安阳,455002 |
| |
| 摘 要： | 对简单图G=〈V,E〉,如果存在一个映射f:V→{0,1,2,…,2 E-1}满足1)对任意的u,v∈V,若u≠v,则f(u)≠f(v);2)对任意的e1,e2∈E,若e1≠e2,则g(e1)≠g(e2),此处g(e)=f(u)+f(v),e=uv;3){g(e)e∈E}={1,3,5,…,2 E-1},则称G为奇强协调图,f称为G的奇强协调标号.给出了直径为4的树的奇强协调标号.
|
| 关 键 词： | 直径 树 奇强协调图 奇强协调标号 |
| 修稿时间： | 2006年2月18日 |
Odd Strong Harmounious of Trees Whose Diameters are Four |
| |
| RAN Hong,LI Wu-zhuang.Odd Strong Harmounious of Trees Whose Diameters are Four[J].Mathematics in Practice and Theory,2007,37(12):133-136. |
| |
| Authors: | RAN Hong LI Wu-zhuang |
| |
| Abstract: | Let G=〈V,E〉 be a simple graph.If there exist a mapping f:V→{0,1,2,…,2|E|-1} Satisfied 1) u,v∈V,if u≠v,then f(u)≠f(v);2) e1,e2∈E,if e1≠e2,then g(e1)≠g(e2),here g(e)=f(u)+f(v),e=uv;3) {g(e)|e∈E }={1,3,5,…,2|E|-1},then G is called odd strong harmonious graph and f is called odd strong harmonious labeling of G.In this paper,We give odd strong harmonious labeling of trees whose diameters are four. |
| |
| Keywords: | diameters tree odd strong harmonious graph odd strong harmonious labeling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
