序列标号的几个充要条件  

Several necessary and sufficient conditions of sequential labeling

作　　者：朱振广[1] 王娟[1] 吴罗义[1] 

机构地区：[1]辽宁工学院数理科学系,辽宁锦州121001

出　　处：《辽宁工程技术大学学报（自然科学版）》2007年第3期476-478,共3页Journal of Liaoning Technical University (Natural Science)

基　　金：辽宁省教育厅基金资助项目(05L187)

摘　　要：为处理纠错码问题提供理论基础,使用映射分析和邻接矩阵的方法,给出一般序列标号的几个充分必要条件,得到使用计算机检查图的点标号是否为序列标号的方法;讨论了序列标号的唯一性问题和序列标号导出的边标号最小值c的取值范围,获得c满足的条件;针对正则图给出c的简洁表达式.这些结果可以用来构造不同的序列标号,判别一个图为非序列图,检查一个标号是否为序列标号,这些结果在通信领域有较大的应用价值.For providing the theory groundwork to error-correcting codes, using the methods of mapping analysis and adjacency matrix, some necessary and sufficient conditions of sequential labeling are obtained, and the method for judging a sequential labeling by computer is given. The number of a sequential labeling of a graph with the minimum induced edge label c is discussed. The compact expression of the minimum induced edge label c is obtained for regular sequential graphs. These results can be used to construct the different sequential labeling of a sequential graph G in communication scopes.

关 键 词：编码 序列标号 向量的点乘积 

分 类 号：O157.51[理学—数学]