摘要
图G的标号是指G的节点集到一个整数集的映射g,且由g(u)、g(v)诱导出边euv的标号.本文定义了序列树的根积运算,并研究了满足一定条件的序列树的根积的序列性,得到了一类新的节点数较多且非毛毛虫的树为序列图.
The labelling of a graph G is an injection g of the labels of vertices to a set of integers, and the labels of each edge euv are induced by the g(u) and g(v). In this paper, an operation of product with the roots of two tress is given. And giving some sequential trees which satisfy some special properties, we study the sequential labelling of their product with their roots. So, we find a type of big trees (not caterpillar) which are sequential.
出处
《北方交通大学学报》
CSCD
北大核心
2003年第3期46-49,共4页
Journal of Northern Jiaotong University
关键词
标号
序列图
序列树
labeling
sequential graph
sequential tree
