For a graph G, a bijection f is called an odd prime labeling , if ffrom V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatestcommon divisor of the labels of end vertices (f(u); f(v)) is one. Inthis paper we investigate the existence of odd prime labeling of somenew classes of graphs and we prove that the graphs such as the Z -Pngraph, Fish graph, Umbrella graph, Cocount tree , F-tree, Y -tree andDouble Sunflower graph are odd prime graphs
A bijection f from vertex set V of a graph G to {1, 2,..., |V |} is called a prime cordial labeling ...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the ...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
The purpose of this paper is to give some new families of graphs that have a prime labeling and give...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
A graph G with p points is called a prime labeling , if it possibleto label the points x 2 V with di...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct p...
Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
In a graph G a mapping g is known as odd prime labeling , if g is abijection from V to f1; 3; 5; :::...
In the present work we have discussed relative prime of split graph of the path graph when is odd o...
A bijection f from vertex set V of a graph G to {1, 2,..., |V |} is called a prime cordial labeling ...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the ...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
The purpose of this paper is to give some new families of graphs that have a prime labeling and give...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
A graph G with p points is called a prime labeling , if it possibleto label the points x 2 V with di...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct p...
Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
In a graph G a mapping g is known as odd prime labeling , if g is abijection from V to f1; 3; 5; :::...
In the present work we have discussed relative prime of split graph of the path graph when is odd o...
A bijection f from vertex set V of a graph G to {1, 2,..., |V |} is called a prime cordial labeling ...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
DOI
Add to ORKG