| 具有完美匹配且直径不大于7的强优美树 |
| |
| 引用本文： | 陶海霞,姚兵,周向前.具有完美匹配且直径不大于7的强优美树[J].河南师范大学学报(自然科学版),2012,40(1):7-10. |
| |
| 作者姓名： | 陶海霞 姚兵 周向前 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院,兰州,730070 |
| |
| 摘 要： | 一棵具有n个顶点且有完美匹配M的树T,若有一个优美标号f使得对T的每条边uv∈M都有f(u)+f(v)=n-1,则称树T是强优美的.证明所有直径不大于7且有完美匹配的树都是强优美的,并给出了一种构造大的强优美树的方法.
|
| 关 键 词： | 树 强优美标号 完美匹配 |
Strongly Graceful Trees with Perfect Matchings and Diameters not Greater than 7 |
| |
| TAO Hai-xia
,
YAO Bing
,
ZHOU Xiang-qian.Strongly Graceful Trees with Perfect Matchings and Diameters not Greater than 7[J].Journal of Henan Normal University(Natural Science),2012,40(1):7-10. |
| |
| Authors: | TAO Hai-xia YAO Bing ZHOU Xiang-qian |
| |
| Institution: | (College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China) |
| |
| Abstract: | A Tree T with n vertices and a perfect matching M is strongly graceful if it has a graceful labeling f such that f(u)+f(v)=n-1 hold for all edges uv∈M.This research shows that all trees with diameter not greater than seven and perfect matchings are strongly graceful,and furthermore gives a constructive methods for constructing large scale of strongly graceful trees. |
| |
| Keywords: | trees strongly graceful labeling perfect matching |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
