一类序列树的构造  

A Class of Sequential Tree Construction

作　　者：吴罗义[1] 朱振广[1] 阚永志[1] 

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

出　　处：《辽宁工业大学学报（自然科学版）》2009年第4期268-271,共4页Journal of Liaoning University of Technology(Natural Science Edition)

摘　　要：图G的标号指f是V(G)到整数集合的一个映射,然后边xy∈E(G)由f(x),f(y)导出标号,仿照优美图中平衡标号的概念,定义图的序列平衡标号的概念,利用一类具有序列平衡标号的树构造更多顶点的序列树。A labeling of graph G was an injectionffrom the set of vertices to a set of integers, and the labels of each edge xy was induced by f（x） and f（y）. Then, a notion of balance labeling about the graceful graph was copied and built, in terms of the notion, the notion of sequential balance labeling about the sequential graph was defined. By means of a class of sequential balance labeling, the tree of more vertices were constructed.

关 键 词：序列图 序列标号 序列平衡标号 

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