-Cordial
Further Results on Prime Cordial Labeling
... prime cordial labeling of a graph G with vertex set V(G) is a bijection f : V(G) → {1, 2, 3,… ,|V(G)|} such that for every edge uv is assigned the label 1 if gcd (f(u), f(v)) = 1 and 0 if gcd (f(u), f(v)) > 1, ...
8
Further Results on Vertex Odd Divisor Cordial Labeling of Some Graphs
... The vertex odd divisor cordial labeling is a variation of cordial labeling. It is very interesting to study graph or families of graph which are vertex odd divisor cordial as all t admit vertex odd ...
8
Subtract Divisor Cordial Labeling
... We introduce here new idea of subtract divisor cordial labeling. This will add new dimension to the research work in the area connecting two branches graph labeling and number theory. Here we have investigated ten ...
5
Further Results on Divisor Cordial Labeling
... divisor cordial for n ≥ 7 . The divisor cordial labeling of full binary tree as well as some star related graphs are reported by Varatharajan et ...divisor cordial graphs by Vaidya and Shah ...
10
k-Remainder Cordial Graphs
... Definition 1. Let G be a (p, q) graph. Let f be a map from V (G) to the set {1, 2, . . . , k} where k is an integer 2 < k ≤ |V (G)|. For each edge uv assign the label r where r is the remainder when f (u) is divided ...
12
Fibonacci Product Cordial Labelling of some Graphs
... In graph labeling vertices or edges or both assigned values subject to certain conditions. There are many types of labeling. More number of labeling techniques found their starting point from graceful labeling introduced ...
6
Neighbourhood Edge Product Cordial And Total Neighbourhood Edge Product Cordial Labeling Of Graphs
... product cordial labeling and total neighbourhood edge product cordial labeling of graph are ...product cordial labeling of Paths, kG, G 1 ∪G 2 , K 1,n,n ∪W n ∪C m , K 1,n,n ∪W n ∪C m under some ...
8
Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles
... [9] A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (Internat. Symposium, Rome, July 1996), Gordon and Breach, N. Y. and Dunod Paris 349- 355, (1967). [10] P. Sumathi, A. Mahalakshmi, ...
6
Remainder Cordial Labeling of Graphs
... In this paper we introduce remainder cordial labeling of graphs. Let G be a (p, q) graph. Let f : V (G) → {1, 2, ..., p} be a 1 − 1 map. For each edge uv assign the label r where r is the remainder when f(u) is ...
14
Several result on SD-prime cordial graphs
... Let G = (V (G),E (G)) be a simple, finite and undirected graph with vertex set V (G) and edge set E (G). All notation not defined in this paper can be found in [4]. Graph labeling is currently an emerging area in the ...
7
$k$-Total difference cordial graphs
... difference cordial la- beling is called a k-total difference cordial ...difference cordial labeling of some graphs and study the 3-total difference cordial labeling behaviour of ...
8
Mean Square Cordial Labeling of Some Snake Graphs
... square cordial labelling related to some acyclic graphs and its rough approximations , National Conference on Mathematical Techniques and its Applications (NCMTA 18) IOP Publishing IOP ...
5
Abstract. In this paper, we investigate the SD-Prime cordial labeling of Pl n
... 9. A.Lourdusamy and F.Patrick, New construction on SD-prime cordial labeling, In: Arumugam S., Bagga J., Beineke L., Panda B. (eds) Theoretical Computer Science and Discrete Mathematics, ICTCSDM 2016, Lecture ...
7
Further results on total mean cordial labeling of graphs
... Graphs considered here are finite, undirected and simple. The symbols V (G) and E(G) will denote the vertex set and edge set of a graph G. The order and size of a graph G are respectively denoted by p and q. Origin of ...
11
Totally magic cordial labeling of some graphs
... magic cordial (TMC) labeling is due to Cahit [2] as a modification of edge-magic total labeling and cordial ...magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E (G) → { ...
8
Some EP-cordial Graphs
... product cordial) labeling of a graph G as a function f from the verticies of a graph to {0,1,-1} such that if each edge uv is assigned the label f(u)f(v),then |v f (i)-v f (j)|≤1 ...
5
Intersection Cordial Labeling of Graphs
... A vertex labeling [4] of a graph G is an assignment f of labels to the vertices of G that induces for each edge uv a label depend- ing on the vertex label f(u) and f(v) . The two best known labeling methods are called ...
5
On Signed Product Cordial Labeling
... f u f v , the number of vertices la- beled with 0 and the number of vertices labeled with 1 differ by at most 1, and the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph ...
6
Face And Total Face Product Cordial Labeling Of Graphs
... product cordial labeling of a graph G with vertex set V is a function f from V to {0, 1} such that if each edge uv is assigned a label f(u) f(v), the number of vertices and edges labeled with 0 and the number of ...
10
A note on 3-Prime cordial graphs
... of cordial labeling of graphs ...prime cordial labeling. A prime cordial labeling of a graph G with vertex set V is a bijection f : V → {1, 2, ...prime cordial labeling behavior of various ...
11