序贯可加图的结构  

Structare of Sequentially Additive Graphs

作　　者：陈东灵[1] 2韩丛英 

机构地区：[1]山东科技大学信息科学与工程学院 [2]上海交通大学应用数学系上海200240

出　　处：《数学物理学报（A辑）》2004年第2期207-210,共4页Acta Mathematica Scientia

基　　金：国家自然科学基金资助项目 ( 1 0 1 71 0 5 5 ;1 9871 0 5 2 )

摘　　要：给定一个 ( p,q) -图 G和一个正整数 k,G的一个 k-序贯可加性编码是不同的数 k,k+ 1 ,… ,k+ p+ q- 1到 G的 p+ q个元素的一种分配 ,使得 G的每一边 e=uv得到分配给顶点 u和 v的数值之和 .若图的元素容许有这样的一种分配 ,则称该图是一个 k-序贯可加图 .该文将给出序贯可加图的若干结构性质 ,并构造一个 k-序贯可加图的无限簇 .Given a (p,q)-graph G and positive integer k, an k-sequentially additive numbering of G is an assignment of distinct numbers k,k+1,…,k+p+q-1, to the p+q elements of G such that every edge uv of G receives the sum of the numbers assigned to the vertices u and v. A graph which admits such an assignment to its elements is called an k-sequentially additive graph. In this paper, the authors give some structural properties on sequentially additive graph, and a construction of infinite families of k-sequentially additive graphs.

关 键 词：图 编码 结构 序贯可加性 

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