| 关于Hadamard标号图 |
| |
| 引用本文： | 卜长江,张晓威.关于Hadamard标号图[J].黑龙江大学自然科学学报,2004,21(4):107-111. |
| |
| 作者姓名： | 卜长江 张晓威 |
| |
| 作者单位： | 哈尔滨工程大学,理学院,黑龙江,哈尔滨,150001;哈尔滨工程大学,理学院,黑龙江,哈尔滨,150001 |
| |
| 基金项目： | Supported by the Fundamental Research Fund of Harbin Engineering University ( HEUF04019) |
| |
| 摘 要： | 一个阶图称为Hadamard标号图,如果的顶点能被标以分量为1,-1的不同的n维向量,使得的每一条边的两个顶点的向量是正交的.基于Hadamard矩阵问题的研究提出了Hadamard标号图的概念,并讨论了其属性.
|
| 关 键 词： | Hadamard矩阵 Hadamard标号 Hadamard标号图 |
On Hadamard Labeling Graphs |
| |
| BU Chang-jiang,ZHANG Xiao-wei.On Hadamard Labeling Graphs[J].Journal of Natural Science of Heilongjiang University,2004,21(4):107-111. |
| |
| Authors: | BU Chang-jiang ZHANG Xiao-wei |
| |
| Abstract: | An n order graph G is said to be Hadamard Labeling Graph, if its vertices can be assigned to distinct n- dimensional vector, every component of which belongs to the set {1, -1}, and therefore two vectors assigned to the adjacent vertices of each edge is perpendicular. An original research on Hadamard Labeling Graphs is shown. |
| |
| Keywords: | Hadamard Matrix Hadamard Labeling Hadamard Labeling Graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
