AbstractBy using the structure of the adjacency matrix of a cordial graph, we characterize cordial graphs, then investigate sufficient conditions for NEPS graphs built from cordial graphs to be cordial. A sub-class of cordial graphs, symmetric balanced cordial graphs, is introduced
An integer cordial labeling of a graph $G(p,q)$ is an injective map $f:V\rightarrow [-\frac{p}{2}......
A function f from vertex set V of a graph G to the set {0, 1} is called cordial labeling if the edge...
A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of ...
AbstractBy using the structure of the adjacency matrix of a cordial graph, we characterize cordial g...
AbstractIn this paper we give an equivalent definition of a cordial graph. The definition implies a ...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and th...
AbstractWe introduce A-cordial graphs, for an abelian group A. (If A = Zk we call them k-cordial gra...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper, we show that the disjoint union of two cordial graphs one of them is of even size is ...
A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions |v0 − v1 | ≤ ...
We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn ...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
A labeling of the vertices of a graph by elements of any abelian group A induces a labeling of the e...
An integer cordial labeling of a graph $G(p,q)$ is an injective map $f:V\rightarrow [-\frac{p}{2}......
A function f from vertex set V of a graph G to the set {0, 1} is called cordial labeling if the edge...
A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of ...
AbstractBy using the structure of the adjacency matrix of a cordial graph, we characterize cordial g...
AbstractIn this paper we give an equivalent definition of a cordial graph. The definition implies a ...
An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we c...
A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and th...
AbstractWe introduce A-cordial graphs, for an abelian group A. (If A = Zk we call them k-cordial gra...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
In this paper, we show that the disjoint union of two cordial graphs one of them is of even size is ...
A graph is said to be cordial if it has 0-1 labeling that satisfies certain conditions |v0 − v1 | ≤ ...
We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn ...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
A graph is said to be cordial if it has a 0-1 labeling that satisfies certain properties. In this pa...
A labeling of the vertices of a graph by elements of any abelian group A induces a labeling of the e...
An integer cordial labeling of a graph $G(p,q)$ is an injective map $f:V\rightarrow [-\frac{p}{2}......
A function f from vertex set V of a graph G to the set {0, 1} is called cordial labeling if the edge...
A $(0,1)$-labelling of a set is said to be {\em friendly} if approximately one half the elements of ...
DOI
Add to ORKG