反算术图  

Anti-arithmetic Graphs

作　　者：刘世祥[1] 

机构地区：[1]北京建筑工程学院基础部,北京100044

出　　处：《北京建筑工程学院学报》2004年第4期62-64,共3页Journal of Beijing Institute of Civil Engineering and Architecture

摘　　要：一个图G被称为 (k ,d)反算术图 ,如果可以给它的每个顶点上的边分配不同的非负整数 ,使得由分配每个顶点上的边的数之和得到顶点值能够排成一个算术级数k ,k +k ,k + 2d ,… ,k + (q - 1)d .该文研究了有限反算术图的结构 .A graph G is said to be (k,d) anti-arithmatic if e dg e of its vertiles can be assigned distinct nonnegative integers so that the valu es of the vertices, obtained as the sums of the numbers assigned to their edges of the vertice, can be arranged in the arithmetic progression k, k+d,k+2d, …,k+ (q-1)d. A study on the structures of finite (k,d) anti-arithmetic graphs is pr esented.

关 键 词：反算术图 顶点函数 边函数 圈 

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