Add to ORKGA prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels. The results about prime labeling of wheel, helm, flower, crown and union of crown graphs are very well-known. In this paper we obtain prime labeling of various graphs resulting from the subdivision of edges in these graphs.Publisher's Versio
The prime labeling of a graph \(G\) of order \(n\) is a bijection function from the set of vertices...
Let G be a graph with vertex set V (G) and edge set E(G). For u ∈ V (G), NV (u) = {w ∈ V (G)|uw ∈ E(...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers f...
A prime labeling of a graph of order n is an assignment of the integers 1, 2, ... , n to the vertice...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
A simple n-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with ...
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set o...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
The prime labeling of a graph \(G\) of order \(n\) is a bijection function from the set of vertices...
Let G be a graph with vertex set V (G) and edge set E(G). For u ∈ V (G), NV (u) = {w ∈ V (G)|uw ∈ E(...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
A prime labeling of a graph G with n vertices is a labeling of the vertices with distinct integers f...
A prime labeling of a graph of order n is an assignment of the integers 1, 2, ... , n to the vertice...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
A simple n-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with ...
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set o...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
The prime labeling of a graph \(G\) of order \(n\) is a bijection function from the set of vertices...
Let G be a graph with vertex set V (G) and edge set E(G). For u ∈ V (G), NV (u) = {w ∈ V (G)|uw ∈ E(...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...