We begin with finite, undirected and non-trivial graph 
with the vertex set 
and the edge set
. Throughout this work 
denotes the cycle with 
vertices and 
denotes the path on 
vertices. In the wheel 
the vertex corresponding to 
is called the apex vertex and the vertices corresponding to 
are called the rim vertices, where
. The star 
is a graph with one vertex of degree 
called apex and 
vertices of degree one called pendant vertices. Throughout this paper 
and 
denote the cardinality of vertex set and edge set respectively.
For various graph theoretic notation and terminology we follow Gross and Yellen [
Definition 1.1: If the vertices are assigned values subject to certain condition(s) then it is known as graph labeling.
Vast amount of literature is available in printed as well as in electronic form on different kind of graph labeling problems. For a dynamic survey of graph labeling problems along with extensive bibliography we refer to Gallian [
Definition 1.2: A prime labeling of a graph 
is an injective function 
such that for every pair of adjacent vertices 
and
,
. The graph which admits a prime labeling is called a prime graph.
The notion of a prime labeling was originated by Entringer and was discussed in a paper by Tout et al. [
and 
are prime graphs. Lee et al. [
is a prime graph if and only if 
is even. Deretsky et al. [
is a prime graph.
Definition 1.3: Let u and v be two distinct vertices of a graph
. A new graph 
is constructed by identifying (fusing) two vertices u and v by a single new vertex x such that every edge which was incident with either u or v in 
is now incident with x in
.
Vaidya and Kanani [
and 
(with
) of 
(
) is a prime graph. The switching invariance of various prime graphs is discussed by Vaidya and Prajapati [
Bertrand’s Postulate 1.4: For every positive integer 
there is a prime 
such that
.
is a prime graph.
. Therefore we start with
. Let 
be the apex vertex and 
be the consecutive pendant vertices of
. Due to the nature of 
two vertices can be identified in following two possible ways:
is identified with any of the pendant vertices (say
). Let the new vertex be 
and the resultant graph be
.
, for 
and 
as there is a loop incident at
. Define 
as 
for 
and
. Obviously f is an injection and
for every pair of adjacent vertices
and 
of
. Hence 
is a prime graph.
and
) are identified. Let the new vertex be 
and the resultant graph be G. So in G, 
, for 
, 
and
. Define 
as 
for 
and
. Obviously f is an injection and 
for every pair of adjacent vertices 
and 
of
. Hence 
is a prime graph.
is shown in 
is shown in 
is a prime and 
is a prime graph of order 
then the graph obtained by identifying two vertices with label 1 and 
is also a prime graph.
and 
be the label of the vertex 
for
. Moreover 
be the new vertex of the graph 
which is obtained by identifying 
and 
of
. Define 
as
is an injection. For an arbitrary edge 
of 
we claim that
. To prove our claim the following cases are to be considered.
then 
= 
=
= 1.
and 
then 
=
=
.
and 
then 
for some 
with 
then 
= 
= 
as 
and 
are adjacent vertices in the prime graph 
with the prime labelling
. Thus in all the possibilities 
admits a prime labeling for
. Hence 
is a prime graph.
of order 5 and the prime labeling for the graph 
obtained by identifying the vertices of 
with label 1 and 5 are shown.
is a prime graph.
be the vertices of
. Let 
be the new vertex of the graph 
obtained by identifying two distinct vertices 
and 
of
. Then 
is nothing but a cycle (possibly loop) with at the most two
. Such graph is a prime graph as proved in Vaidya and Prajapati [
and the graphs obtained by identifying two vertices in various possible ways are shown.
of 
there exits a prime labeling f satisfying
.
is a strongly prime graph as any vertex of 
can be assigned label 1 and the remaining vertices can be assigned label 2 and 3 as shown in 
is an edge of 
then 
is a prime graph (see 
with degree 2 can be assigned the label 1. Suppose 
is assigned the label 1 then available vertex labels for the remaining three vertices of 
are 2, 3 and 4. Consequently the vertices corresponding to the labels 2 and 4 are adjacent in
. See 
be the consecutive vertices of
. If 
is any arbitrary vertex of 
then we have the following possibilities:
is either of the pendant vertices (say
) then the function 
defined by
, for all
, is a prime labeling for 
with
.
is not a pendant vertex then 
for some 
then the function 
defined by
.
is a strongly prime graph.
in order to obtain different prime labeling as shown in Figures 13-18.
be the consecutive vertices of
. Let 
be an arbitrary vertex of
. Then 
for some
. The function 
defined by
with
. Thus 
admits prime labeling as well as it is possible to assign label 1 to any arbitrary vertex of
. That is
, is strongly prime graph.
is a strongly prime graph.
, 2 the respective graphs 
and 
are strongly prime graphs as proved in the Theorem 3.5.
let 
be the apex vertex and 
be the pendant vertices of
.
is any arbitrary vertex of 
then we have the following possibilities:
is the apex vertex then
. Then the function 
defined by 
for 
is a prime labeling on 
with
.
is one of the pendant vertices then 
for some
. Define
, 
, where 
is the largest prime less than or equal to 
and the remaining 
vertices are distinctly labeled from
. According to Bertrand’s postulate
. Therefore 
is co-prime to every integer from
. Thus every edge 
is incident to the apex vertex 
whose label is
, thus 
or
. Hence this function 
admits a prime labeling on 
with
.
is a strongly prime graph.
in order to obtain prime labeling as shown in Figures 19 and 20.
is a strongly prime graph for every even positive integer
.
be the apex vertex and 
be the consecutive rim vertices of
. Let 
be an arbitrary vertex of
. We have the following possibilities:
is the apex vertex of 
that is
. Then the function 
defined as
is an injection. For an arbitrary edge 
of 
we claim that
. To prove our claim the following subcases are to be considered.
=
=
as 
and 
are consecutive positive integers.
then 
= 
as 
is an odd integer and it is not divisible by 2.
for some 
then 
=
.
is one of the rim vertices. We may assume that 
where 
is the largest prime less than or equal to
. According to the Bertrand’s Postulate such a prime 
exists with
. Define a function 
as
are interchanged. Then clearly 
is an injection.
of 
we claim that
. To prove our claim the following subcases are to be considered.
for some 
then 
as 
is co-prime to every integer from
.
for some 
then 
as 
and 
are consecutive positive integers.
for 
then 
=
.
for 
then 
admits prime labeling as well as it is possible to assign label 1 to any arbitrary vertex of
. That is, 
is a strongly prime graph for every even positive integer
.
in order to obtain prime labeling as shown in Figures 21 and 22.
is a strongly prime graph.
is a one point union of 
copies of
. It can also be thought as a graph obtained by deleting every alternate rim edge of
. Being a spanning subgraph of strongly prime graph
, 
is a strongly prime graph.
is a strongly prime graph.
is obtained from strongly prime graph 
by deleting all the rim edges of the
. Being a spanning subgraph of strongly prime graph
, 
is a strongly prime graph.