In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of edges labelled with even integers and number of edges labelled with odd integers. A graph with a quotient cordial labeling is called a quotient cordial graph. We investigate the quotient cordial labeling behavior of path, cycle, complete graph, star, bistar etc
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Let G = (V; E) be a graph and let f: V! f0; 1g be a mapping from the set of vertices to f0; 1g and f...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
An integer cordial labeling of a graph G(V, E) is an injective map f from V to − 2 . . 2 ∗ or − 2...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
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 investigate mean cordial labeling behavior of union of some graphs, square of paths...
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...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
A graph with admits a k-remainder cordial labeling is called a k-remainder cordial graph. In this pa...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
Abstract. A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Let G = (V; E) be a graph and let f: V! f0; 1g be a mapping from the set of vertices to f0; 1g and f...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
An integer cordial labeling of a graph G(V, E) is an injective map f from V to − 2 . . 2 ∗ or − 2...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
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 investigate mean cordial labeling behavior of union of some graphs, square of paths...
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...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
A graph with admits a k-remainder cordial labeling is called a k-remainder cordial graph. In this pa...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
Abstract. A divisor cordial labeling of a graph G with vertex set V vertex G is a bijection f from V...
A prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |}...
Let G = (V; E) be a graph and let f: V! f0; 1g be a mapping from the set of vertices to f0; 1g and f...
In this paper we investigate the 4- remainder cordial behavior of grid, subdivision of crown, Subdiv...
DOI
Add to ORKG