Add to ORKGIn this paper, we discuss 4-cordial labeling of some path related graphs. We prove that middle graph, total graph and splitting graph of the path are 4-cordial. In addition to this we prove that P 2n and triangular snakes are 4-cordial
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
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...
In this paper we investigate 4-prime cordial labeling behavior of shadow graph of a path, cycle, sta...
A graph is said to be cordial if it has a 0−1 labeling that satisfies certain properties. The third ...
A graph with admits a k-remainder cordial labeling is called a k-remainder cordial graph. In this pa...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
<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 ≤...
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...
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...
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 ...
A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and th...
Let G be a (p; q) graph. Let f : V (G) ! f1; 2; : : : ; kg be afunction. For each edge uv, assign th...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
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...
In this paper we investigate 4-prime cordial labeling behavior of shadow graph of a path, cycle, sta...
A graph is said to be cordial if it has a 0−1 labeling that satisfies certain properties. The third ...
A graph with admits a k-remainder cordial labeling is called a k-remainder cordial graph. In this pa...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
<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 ≤...
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...
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...
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 ...
A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and th...
Let G be a (p; q) graph. Let f : V (G) ! f1; 2; : : : ; kg be afunction. For each edge uv, assign th...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tens...
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...