In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs
The concept of cordial labeling in graphs motivated us to introduce cordial words, cordial languages...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
ABSTRACT ARTICLE INFO A graph G is said to have a totally magic cordial la-beling with constant C if...
Tyt. z nagłówka.Bibliogr. s. 121.A graph G is said to have a totally magic cordial (TMC) labeling wi...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to a...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We introduce a new graph labeling technique called k- total difference cordial labeling .Let f:V(G)→...
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...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
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...
In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investigate the ...
The concept of cordial labeling in graphs motivated us to introduce cordial words, cordial languages...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
ABSTRACT ARTICLE INFO A graph G is said to have a totally magic cordial la-beling with constant C if...
Tyt. z nagłówka.Bibliogr. s. 121.A graph G is said to have a totally magic cordial (TMC) labeling wi...
Abstract In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investi...
In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling...
In this paper we investigate mean cordial labeling behavior of union of some graphs, square of paths...
We proved that Pn+1m is total product cordial. We also give sufficient conditions for the graph to a...
In this paper we introduce quotient cordial labeling of graphs, respectively denote the number of ed...
We introduce a new graph labeling technique called k- total difference cordial labeling .Let f:V(G)→...
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...
Let be a graph. A prime cordial labeling of with vertex set is a bijection from to such that i...
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...
In this paper we introduce the k-Total Product cordial labelling of graphs. Also we investigate the ...
The concept of cordial labeling in graphs motivated us to introduce cordial words, cordial languages...
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonio...
Graph labeling is currently an emerging area in the research of graph theory. A graph labeling is an...
DOI
Add to ORKG