Let G = (V (G), E (G)) be a graph. Consider the group S3. For , let denote the order of u in S3. Let be a function defined in such a way that . Let denote the number of vertices of G having label j under . Now is called a group cordial prime labeling if for every . A graph which admits a group cordial prime labeling is called a group cordial prime graph. In this paper, we prove that the Helm graph, Flower graph and are group S3 cordial prime
Let G be a (p, q) graph. Let f be a function from V (G) to the set {1, 2, . . . , k} where k is an ...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We present here prime cordial labeling for the graphs obtained by some graph operations on given gra...
Let G be a (p,q) graph. Let f : V(G) ⇾ {1,2,…k} be a function. For each edge uv, assign the label g...
Let G be a (p,q)graph and A be a group. Let f : V (G) → A be a function. The order of a ∈ A is the l...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k ∈N and k > 1. For each e...
A k-edge labeling of a graph G is a function f : E(G) -> {0, ... , k-1}. Such a labeling induces a l...
Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivis...
A bijection f from vertex set V of a graph G to {1, 2,..., |V |} is called a prime cordial labeling ...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Let G be a (p; q) graph. Let f : V (G) ! f1; 2; : : : ; kg be afunction. For each edge uv, assign th...
In this paper we investigate 4-prime cordial labeling behavior of shadow graph of a path, cycle, sta...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
Let G be a (p, q) graph. Let f be a function from V (G) to the set {1, 2, . . . , k} where k is an ...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We present here prime cordial labeling for the graphs obtained by some graph operations on given gra...
Let G be a (p,q) graph. Let f : V(G) ⇾ {1,2,…k} be a function. For each edge uv, assign the label g...
Let G be a (p,q)graph and A be a group. Let f : V (G) → A be a function. The order of a ∈ A is the l...
Graph labeling is an important area of research in Graph theory. There are many kinds of graph label...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k ∈N and k > 1. For each e...
A k-edge labeling of a graph G is a function f : E(G) -> {0, ... , k-1}. Such a labeling induces a l...
Recently three prime cordial labeling behavior of path, cycle, complete graph, wheel, comb, subdivis...
A bijection f from vertex set V of a graph G to {1, 2,..., |V |} is called a prime cordial labeling ...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Let G be a (p; q) graph. Let f : V (G) ! f1; 2; : : : ; kg be afunction. For each edge uv, assign th...
In this paper we investigate 4-prime cordial labeling behavior of shadow graph of a path, cycle, sta...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
Let G be a (p, q) graph. Let f be a function from V (G) to the set {1, 2, . . . , k} where k is an ...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We present here prime cordial labeling for the graphs obtained by some graph operations on given gra...
DOI
Add to ORKG