Publication date
September 2018
DOIAbstract
In the present work we have discussed relative prime of split graph of the path graph when is odd or even. We have derived an algorithm which admits prime labeling to the split graph of the path graph
In the present work we have discussed relative prime of split graph of the path graph when is odd or even. We have derived an algorithm which admits prime labeling to the split graph of the path graph
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct ...
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct ...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the ...
A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct p...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct...
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 admit prime labeling if its vertices can be labeled wi...
For a graph G, a bijection f is called an odd prime labeling , if ffrom V to f1; 3; 5; ::::; 2jV j -...
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set o...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
The purpose of this paper is to give some new families of graphs that have a prime labeling and give...
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...
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct ...
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct ...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
Graph labeling can be mentioned as one of the most prominent research areas in graph theory and the ...
A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct p...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distinct...
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 admit prime labeling if its vertices can be labeled wi...
For a graph G, a bijection f is called an odd prime labeling , if ffrom V to f1; 3; 5; ::::; 2jV j -...
A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set o...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
The purpose of this paper is to give some new families of graphs that have a prime labeling and give...
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...
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct ...
Linear prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the direct ...
Add to ORKG