Strongly Arithmetic Graphs
Yu Ping · Shuxue jikan · 2000
A (p,q)_graph G is said to be strongly (k,d)_arithmetic if the vertex function f:V(G)→Z q is and injection from the vertices of G to the group of integers modulo q,such that the values of the edges obtained as the sums of the numbers assigned to their vertices,can be arranged in the arithmetic progression k,k+d,……,k+(q-1)d,in this paper we initiate a study on the structures of this labeled graph.