一类图的序列标号

Sequential labelings of a class of graphs

轮图 Wn(n≥ 3)是由回路 Cn 的每个顶点都与同一个不在 Cn上的顶点相联接所得到的图 .在 Wn的属于 Cn 的每个顶点上都粘接一条悬挂边所得到的图 ,记作 Q(Wn) . 本文考虑了Q(Wn)的序列标号 ,证明了对任意自然数 n≥ 3,Q(Wn)都是序列图 .

Let the wheel W n(n≥3) be a graph obta ined by joining one point outside the cycle C n to every vertex of C n. The graph derived from W n, by sticking one pendent edge at every vertex of C n, is denote d Q(W n). Sequential labelings of Q(W n ) are considered, and it i s proved that all Q(W n) are sequential graphs for every natura l number n≥3.