序列图的一些必要条件与非序列图类  

Some necessary conditions of sequential graphs and the classes of non-sequential graphs

作　　者：朱振广[1] 徐美进[1] 刘春峰[1] 

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

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

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

摘　　要：为纠错码问题提供理论基础,在运用同余、奇偶性方法的基础上,给出了用点边二种观点分析边标号的方法。使用这种方法,得到了一般序列图、正则序列图、Euler序列图、圈的粘接序列图和圈的并序列图的必要条件,证明了边数为2k,k是奇数的Euler图是非序列图类,讨论了m个n圈的粘接图中的非序列图类;分析偶圈的特征,构造了偶圈的具有同顶点集的序列母图并给出其序列标号表达式。这些结果在通讯、军事等领域有重要应用价值。In order to provide the theory groundwork for error-correcting codes, the method that analyses the sequential edge labels by vertices and edges viewpoint is given. Some necessary conditions are obtained for sequential graphs, regular sequential graphs and Euler sequential graphs; several non-sequential graphs classes are showed for conglutinating graphs. The sequential graphs that contain even cycle with the same vertices have been constructed. These results can be used in communication and military domains.

关 键 词：序列图 序列标号 同余 粘接运算 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]