On Odd Prime Labelings of Snake Related Graphs
Main Article Content
Abstract
For a graph G mapping f is called an odd prime labeling , if f is a bijection from V to {1, 3, 5, ...., 2|V | − 1} satisfying the condition that for each line uv in G the greatest common divisor of the labels of end points is one. Investigated in this paper the odd prime labeling of some new graphs and we prove that some snake related graphs such as quadrilateral snake , Triangular snake , Double Triangular snake , Alternate Triangular snake, Triangular ladder , Open Triangular ladder are odd prime graphs.
Article Details
Issue
Section
Articles