الفهرس Only 14 pages are availabe for public view
 |  | from | 130 |  |  |
| | | from | 130 | | |
Abstract
”Graph labeling at its heart, is a strong communication between num-
ber theory and structure of graphs”. Graph labelings were ¯rst intro-
duced in the late 1960s.
Over the past three decades in excess of 800 papers have spawned a bewildering array of graph labeling methods.
Despite the unabated procession of papers, there are a few general
results on graph labelings.
Labeled graphs serve as useful models for a broad range of applications.
We discuss here some necessary and su±cient conditions for a graph to
be prime.
We also give a necessary and su±cient condition for prime graphs.
Finally we give a procedure to determine whether or not a graph is prime.
We discuss the primality of some corona graphs and some families of graphs.