Prime Labeling of Two Copies of Cycle Related Graphs

Author(s): Thenmozhi S and Karunakaran V

Abstract:

If a graph Ǥ = (V, E) with 'r' vertices, and its vertices are named by unique positive integers not greater than n, then every pair of adjacent vertices is relatively prime. A graph that admits prime numbers is called a prime graph (PG).Graph labeling (GL) is an important area of research in Graph theory. There are many kinds of graph labeling such as Graceful labelingꓹ Magic labelingꓹ Prime labelingꓹ and other differend labeling techniques. In this paper, we discuss the primes of two copies of a Cyclic graph (CG). We also discuss the primes of some graph functions and the paths between two graphs.

keywords:

Pages: 129-131     |    3 View     |    0 Download