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 …

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 …

All trees of diameter five are graceful Page 1 Discrete Mathematics 233 (2001) 133–150
www.elsevier.com/locate/disc All trees of diameter five are graceful Pavel HrnÄciar∗, Alfonz …

A graph labeling is an assignment of integers to the vertices, edges, or to both, and it is
subject to certain conditions. In this paper, a new concept of graph labeling called binary …

Abstract The average Watts–Strogatz clustering coefficient and the network transitivity are
widely used descriptors for characterizing the transitivity of relations in real-world graphs …

Koh, Rogers and Tan (Discrete Math. 25 (1979) 141–148) give a method to construct a
bigger graceful tree from two graceful trees. Based upon their results, we give a new …

A guide to the graph labeling zoo Page 1 ELSBVIER DISCRETE APPLIED MATHEMATICS
Discrete Applied Mathematics 49 (1994) 213-229 A guide to the graph labeling zoo Joseph A …

We investigate the existence of α-valuations and sequential labelings for a variety of grids in
the plane, on a cylinder and on a torus. 1. Introduction. A connected graph with v vertices …

A labelling of a simple graph G=(V, E) is an assignment f of integers to the vertices of G.
Under such a labelling f, we let V i denote the set of vertices in G that are labelled i, and let E …

Abstract Let T=(V, E) be a tree whose vertices are properly 2‐colored. A bipartite labeling of
T is a bijection f: V←{0, 1, ⃛,| E|} for which there is ak such that whenever f (u)≤ k< f (v), then …