Odd Prime Labeling For Some Arrow Related Graphs

Abstract

In a graph G a mapping g is known as odd prime labeling , if g is a bijection from V to f1; 3; 5; ::::; 2jVj - 1g satisfying the condition that for each line xy in G the gcd of the labels of end points (g(x); g(y)) is one. In this article we prove that some new arrow related graphs such as A2 y, A3 y,A5 y, are all odd prime graphs. Also we prove that double arrow graphs, DA2 y and DA3 y are odd prime graphs.

Keywords

• prime graph, odd prime graph, arrow graphs.