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 …

Power Graphs: A Survey Page 1 www.ejgta.org Electronic Journal of Graph Theory and
Applications 1 (2) (2013), 125–147 Power Graphs: A Survey Jemal Abawajya, Andrei …

Graph theory, and graph labeling in particular, are fast-growing research areas in
mathematics. New results are constantly being discovered and published at a rapidly …

A subset W=(u,..., w.) of vertices of a graph G is called a resolving set for G if for every two
distinct vertices ac, ye V (G) there is a vertex u; e W such that d (x, w) é d (y, w), A resolving …

An edge irregular total k-labeling of a graph G=(V, E) is a labeling φ: V∪ E→{1, 2,..., k} such
that the total edge-weights wt (xy)= φ (x)+ φ (xy)+ φ (y) are different for all pairs of distinct …

A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a
bijection f: V (G)∪ E (G)→{0, 1,…,| V (G)|+| E (G)|− 1} such that the sum of labels of edges …

Graph labellings have been used in many applications, such as in the development of
redundant arrays of independent disks which incorporate redundancy utilizing erasure …

( , ) represents the basic chart without circle, if existing a one-to-one
mapping : →{ , ,…,| |}, for any two vertices in the diagram, in the event …

Various types of labelings of graphs have been intensively studied by combinatorialists for
some time. The notion of magic labeling has its origin in very classical Chinese mathematics …

A bijection mapping that assigns natural numbers to vertices and/or edges of a graph is
called a labeling. In this thesis, we consider graph labelings that have weights associated …