الفهرس 
IntroductionOnly 14 pages are availabe for public view
 |  | from | 214 |  |  |
| | | from | 214 | | |
Abstract
A labeling of a graph is a mapping that carries a graph elements (edges or vertices, or both) to positive integers, subject to certain constraints. A labeling of a graph is called vertex (edge) labeling if the domain of the mapping is the vertex (edge) set, while the labeling is called total labeling if the domain of the mapping is the union of vertex and the edge sets.
Graph labeling methods are used for application problems in communication network addressing system, for fasting communication in sensor networks, for designing fault-tolerant systems with facility graphs, in coding theory for the design of good radar type codes and can also use for issues in mobile Ad hoc networks.