Add to ORKGWe have introduced the concept of neighborhood-prime labeling and investigated it for paths, cycles, wheels and union of such graphs earlier. In this paper, we construct neighborhood-prime labelings for graphs that are cartesian or tensor product of two paths
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...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
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 prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set o...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
AbstractA graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian produc...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...
This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total pr...
A graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian product graph,...
A prime labeling of a graph of order n is an assignment of the integers 1, 2, ... , n to the vertice...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
AbstractGiven a graph G, a proper labeling f of G is a one-to-one function from V(G) onto {1,2,…,|V(...
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...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
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 prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set o...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
AbstractA graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian produc...
Graph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theore...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...
This paper examines the graph-theoretical concepts of consecutive prime labeling and highly total pr...
A graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian product graph,...
A prime labeling of a graph of order n is an assignment of the integers 1, 2, ... , n to the vertice...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
AbstractGiven a graph G, a proper labeling f of G is a one-to-one function from V(G) onto {1,2,…,|V(...
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...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...