Odd Prime Labeling For Some Arrow Related Graphs

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...

Full description

Bibliographic Details
Main Authors: Gajalakshmi G, Meena S
Format: Article
Language:English
Published: Accademia Piceno Aprutina dei Velati 2023-03-01
Series:Ratio Mathematica
Subjects:
Online Access:http://eiris.it/ojs/index.php/ratiomathematica/article/view/1059