A graph with a difference cordial labeling is called a difference cordial graph. In this paper we investigate the difference cordial labeling behavior of Splitting, Degree splitting and Shadow graph of some standard graphs
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let f be a map from V(G) to. For each edge uv assign the label 0,1,2 2 f u f v . f is c...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
Abstract. Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2,..., p}. For each edge uv, ass...
A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and th...
In this paper we investigate 3-difference cordial labeling behavior of DTn ⊙ K1 DTn ⊙ 2K1,DTn ⊙ K2 a...
<p>Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤...
Abstract Let G be a (p; q) graph. Let f: V (G) → {1; 2: : : ; p} be a function. For each edge uv, a...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We introduce a new graph labeling technique called k- total difference cordial labeling .Let f:V(G)→...
Abstract. A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
A divisor cordial labeling of a graph G with vertex set V is a bijec-tion f from V to {1, 2,..., | ...
Let G = (V, E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let f be a map from V(G) to. For each edge uv assign the label 0,1,2 2 f u f v . f is c...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
Abstract. Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2,..., p}. For each edge uv, ass...
A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and th...
In this paper we investigate 3-difference cordial labeling behavior of DTn ⊙ K1 DTn ⊙ 2K1,DTn ⊙ K2 a...
<p>Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤...
Abstract Let G be a (p; q) graph. Let f: V (G) → {1; 2: : : ; p} be a function. For each edge uv, a...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We introduce a new graph labeling technique called k- total difference cordial labeling .Let f:V(G)→...
Abstract. A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
A divisor cordial labeling of a graph G with vertex set V is a bijec-tion f from V to {1, 2,..., | ...
Let G = (V, E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let f be a map from V(G) to. For each edge uv assign the label 0,1,2 2 f u f v . f is c...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
DOI
Add to ORKG