A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

With Chromatic Graph Theory, Second Edition, the authors present various fundamentals of
graph theory that lie outside of graph colorings, including basic terminology and results …

A table of binary constant weight codes of length n ý28 is presented. Explicit constructions
are given for most of the 600 codes in the table; the majority of these codes are new. The …

Abstract A (p, q)-graph G is edge-magic if there exists a bijective function f: V (G)∪ E
(G)→{1, 2,…, p+q} such that f (u)+ f (v)+ f (uv)= k is a constant, called the valence of f, for any …

arxiv:math/0407117v1 [math.NT] 8 Jul 2004 A Complete Annotated Bibliography of Work
Related to Sidon Sequences Page 1 arxiv:math/0407117v1 [math.NT] 8 Jul 2004 A Complete …

The queens graph of a (0, 1)-matrix A is the graph whose vertices correspond to the 1's in A
and in which two vertices are adjacent if and only if some diagonal or line of A contains the …

Definition 2.1. 1. Let Γ be a graph on n vertices. Let N (u) denote the set of vertices adjacent
to u in Γ. We call a labelling f: V Γ→{1, 2,..., n} on Γ a Σ− labelling if∑ v∈ N (u) f (v) is …

We introduce A-cordial graphs, for an abelian group A.(If A= Z k we call them k-cordial
graphs.) These generalize harmonious, elegant, and cordial graphs. They also provide a …

Abstract A (p, q)‐graph G is said to be (k, d)‐arithmetic if its vertices can be assigned distinct
nonnegative integers so that the values of the edges, obtained as the sums of the numbers …

r(r+l)>_e" Page 1 SIAM J. ALG. DISC. METH. Voi. 4, No. September 1983 1983 Society for
Industrial and Applied Mathematics 0196-5212/83/0403-0003 $01.25/0 ON THE HARMONIOUS …