Add to ORKGIn this paper, we show that the disjoint union of two cordial graphs one of them is of even size is cordial and the join of two cordial graphs both are of even size or one of them is of even size and one of them is of even order is cordial. We also show that Cm ∪ Cn is cordial if and only if m+n ≡ / 2 (mod 4) and mCn is cordial if and only if mn ≡ / 2 (mod 4) and for m, n ≥ 3, Cm + Cn is cordial if and only if (m, n) ≠ (3, 3) and {m,n} ≡ / {0, 2} (mod 4). Finally, we discuss the cordiality of knP
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...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
A graph is said to be cordial if it has a 0−1 labeling that satisfies certain properties. The third ...
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 prove that a star of Kn and a cycle of n copies of Kn are cordial. We also get cond...
AbstractIn this paper we give an equivalent definition of a cordial graph. The definition implies a ...
AbstractLet G1, G2 …, Gn be n (≥ 2) copies of a graph G. We denote by G(n) the graph obtained by add...
AbstractWe introduce A-cordial graphs, for an abelian group A. (If A = Zk we call them k-cordial gra...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
AbstractBy using the structure of the adjacency matrix of a cordial graph, we characterize cordial g...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions |v0 − v1 | ≤ ...
AbstractIn this paper we prove that one edge union of k-copies of shell graphs H(n,n−3) is cordial, ...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
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...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
A graph is said to be cordial if it has a 0−1 labeling that satisfies certain properties. The third ...
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 prove that a star of Kn and a cycle of n copies of Kn are cordial. We also get cond...
AbstractIn this paper we give an equivalent definition of a cordial graph. The definition implies a ...
AbstractLet G1, G2 …, Gn be n (≥ 2) copies of a graph G. We denote by G(n) the graph obtained by add...
AbstractWe introduce A-cordial graphs, for an abelian group A. (If A = Zk we call them k-cordial gra...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
AbstractBy using the structure of the adjacency matrix of a cordial graph, we characterize cordial g...
AbstractSuppose G = (V,E) is a graph with vertex set V and edge set E. A vertex labeling f : V → {0,...
A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions |v0 − v1 | ≤ ...
AbstractIn this paper we prove that one edge union of k-copies of shell graphs H(n,n−3) is cordial, ...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
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...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...