两类图的序列性

Two Classes of Sequential Graph

图G的标号指f是V(G)到整数集合的一个映射,然后边xy∈E(G)由f(x),f(y)导出标号.本文利用一类具有序列平衡标号的树的性质,通过"连结"与"粘接"方式,构造更多顶点的序列树;证明了C2n+1∨Km是序列图.

A labeling of graph G is an injection f from the set of vertices to a set of integers,and the labels of each edge xy is induced by f（x）and f（y）. By a class of tree with sequential balance labeling,through the way of“link”and“bonding”,the sequential tree with more vertices is constructed. It proves that the C2n ＋ 1∨Km is the sequential graph.