Publication date
July 2013
DOIAbstract
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths, subdivision of comb and double comb and some more standard graphs
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths, subdivision of comb and double comb and some more standard graphs
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
In this paper, we discuss 4-cordial labeling of some path related graphs. We prove that middle graph...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
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...
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 introduce quotient cordial labeling of graphs, respectively denote the number of ed...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let G = (V, E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
A graph with admits a k-remainder cordial labeling is called a k-remainder cordial graph. In this pa...
A graph with a difference cordial labeling is called a difference cordial graph. In this paper we in...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
In this paper, we discuss 4-cordial labeling of some path related graphs. We prove that middle graph...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
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...
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 introduce quotient cordial labeling of graphs, respectively denote the number of ed...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
Let G = (V, E) be a graph with p vertices and q edges. A Extended Mean Cordial Labeling of a Graph G...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
A graph with admits a k-remainder cordial labeling is called a k-remainder cordial graph. In this pa...
A graph with a difference cordial labeling is called a difference cordial graph. In this paper we in...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
Let f be a map from V (G) to {0, 1, ..., k − 1} where k is an integer, 1 ≤ k ≤ |V (G)|. For each edg...
In this paper, we discuss 4-cordial labeling of some path related graphs. We prove that middle graph...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
Add to ORKG