Divisor cordial labeling
Abstract. In this paper, we investigate the face sum divisor cordial labeling of switching
... graph labeling is the assignment of unique identifiers to the edges and vertices of a ...graph labeling problems along with an extensive bibliography we refer to Gallian ...of cordial labeling ...
8
Further Results On Square Divisor Cordial Labeling Of Graphs
... graph labeling, we refer to Gallian ...of cordial labeling of ...of divisor cordial labeling of ...of cordial labeling called square divisor cordial ...
6
DIVISOR CORDIAL LABELING IN THE CONTEXT OF JOIN AND BARYCENTRIC SUBDIVISION
... of cordial labeling was introduced by Cahit[3] in which he investigated several results on this ...many labeling techniques are also introduced with minor changes in cordial ...product ...
9
Sum Divisor Cordial Labeling of Theta Graph
... A labeling of graph is a map that carries the graph elements to the set of numbers, usually to the set of non-negative or positive ...the labeling is called total labeling. Cordial ...
8
Sum Divisor Cordial Labeling of Herschel Graph
... A labeling of graph is a map that carries the graph elements to the set of numbers, usually to the set of non-negative or positive ...the labeling is called total labeling. Cordial ...
8
Vertex Odd Divisor Cordial Labeling Of Graphs
... Let G = (V(G), E(G)) be a simple graph with n vertices and f : V → {1,3,…,2n–1|} be a bijection. For each edge uv, assign the label 1 if either f(u) | f(v) or f(v) | f(u) and the label 0 otherwise. f is called a vertex ...
6
Some Results On Divisor Cordial Labeling Of Graphs
... graph labeling, we refer to Gallian ...of cordial labeling of ...of divisor cordial labeling of graph. The divisor cordial labeling of various types of graph ...
6
Divisor Cordial Labeling Of Cycle Related Graphs
... of divisor cordial labeling was introduced by ...are divisor cordial. A dynamic survey of graph labeling is published and updated every year by ...are divisor ...
8
Cube Divisor Cordial Labeling For Some Graphs
... Cube Divisor Cordial Graph were introduced by ...Cube Divisor Cordial Labeling if | (0) − (1)| ≤ ...prime labeling [5] , The graph ⊕ introduced ...K-prime labeling [5] , ...
6
Further Results on Vertex Odd Divisor Cordial Labeling of Some Graphs
... odd divisor cordial labeling is a variation of cordial ...odd divisor cordial as all t admit vertex odd divisor cordial ...odd divisor cordial ...
8
Further Results on Divisor Cordial Labeling
... not 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 ...be divisor cordial ...
10
Subtract Divisor Cordial Labeling
... )|} in such a way that an edge uv give the label 1 if r(u) - r(v) is divisible by 2 otherwise give the label 0, then absolute difference of number of edges having label 1 and 0 is at most 1. A graph which fulfill the ...
5
Some Star Related Vertex Odd Divisor Cordial Labeling of Graphs
... Cordial labeling was introduced by Cahit [1]. Many labeling schemes were introduced with slight variations in cordial such as prime cordial labeling, divisor ...
7
Some New Results on Sum Divisor Cordial Graphs
... a divisor cordial labeling if | e f (0) − e f (1) | ≤ 1 ...a divisor cordial labeling is called a divisor cordial ...
8
Star Attached Divisor Cordial Graphs
... A divisor cordial labeling of graph G with vertex set V is bijection from V to {1,2,……..V(G)} such that if each edge uv is assigned the label 1 if f(u)/ f(v) or f(v)/f(u) and 0 otherwise, then the ...
7
Intuitionistic Fuzzy Divisor Cordial Graph
... In this paper we introduced the concept of intuitionistic fuzzy divisor cordial labeling of graphs. And we discussed some theorems that shows both paths and cycles obey intuitionistic fuzzy ...
9
Some New Families of Divisor Cordial Graph
... Definition 1.4. [10] Let G = (V, E) be a simple graph and f : V → {1, 2, 3, . . . |V|} be a bijection. For each edge uv, assign the label 1 if either f(u) / f(v) or f(v) /f(u) and the label 0 if f(u) f(v). Then f is ...
10
Vol 8, No 4 (2017)
... graph labeling can be attributed to Rosa [3]. A path related relaxed cordial graphs were introduced by ...absolute divisor cordial labeling of a graph and we prove some standard graphs ...
7
Vol 9, No 8 (2018)
... Graph labeling [3] is a strong communication between number theory [2] and structure of graphs ...and cordial labeling concept in graph labeling, we introduce a new concept called Triangular ...
6
Some New Families of Sum Divisor Cordial Graphs
... graph labeling problems along with an extensive bibliography we refer to Gallian ...of cordial labeling was introduced by Cahit ...of divisor cordial labeling of ...sum ...
5