Add to ORKGGraph labeling problems date back to the beginning of Graph Theory itself (see the Four Color Theorem). Roughly 40 years ago, the notion of a prime labeling of a graph was introduced; a graph on n vertices has a prime labeling if its vertices can be labeled by the numbers 1, 2, … , n so that each edge spans a coprime pair (i.e., each edge’s labels have greatest common divisor one). In the 1980s, Entriger conjectured that a certain family of graphs all have prime labelings; our work furthered the progress on this conjecture by giving a prime labeling for several members of this family. Additionally, we studied graph parameters related to the coprime graph. The coprime graph on n vertices is the graph whose vertices are numbered 1, 2, … , n w...
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...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...
Graph labeling problems, such as the Four Color Conjecture, date back to the beginning of Graph Theo...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
The purpose of this paper is to give some new families of graphs that have a prime labeling and give...
A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct p...
The prime labeling of a graph \(G\) of order \(n\) is a bijection function from the set of vertices...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
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...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...
Graph labeling problems, such as the Four Color Conjecture, date back to the beginning of Graph Theo...
A graph G = (V, E) with n vertices is said to admit prime labeling if its vertices can be labeled wi...
AbstractLet G = (V, E) be a graph. A bijection f: V →{;1,2,…,|V|} is called a prime labelling if for...
Prime labeling originated with Entringer and was introduced by Tout, Dabboucy and Howalla. A Graph G...
A graph G = (V,E) with ‘n’ vertices is said to have a prime labeling if its vertices are labelled wi...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
The purpose of this paper is to give some new families of graphs that have a prime labeling and give...
A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct p...
The prime labeling of a graph \(G\) of order \(n\) is a bijection function from the set of vertices...
A graph with vertex set is said to have a prime labeling if its vertices are labeled with distin...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
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...
summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the...