sum 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
Sum Divisor Cordial Labeling of Herschel Graph
... A sum divisor cordial labeling of a graph G with vertex set V G ( ) is a bijection f from V G ( ) to {1, ...a sum divisor cordial labeling is called a sum ...
8
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
Some New Families of Sum Divisor Cordial Graphs
... A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V(G) to {1,2,…, |V(G)|} such that an edge uv is assigned the label 1 if 2 divides f(u)+f(v) and 0 otherwise, ...
5
Some New Results on Sum Divisor Cordial Graphs
... of sum divisor cordial ...the sum divisor cordial labeling behavior of Swastik graph Sw n , path union of finite copies of Swastik graph Sw n , cycle of k copies of ...
8
Vol 9, No 2 (2018)
... and edges with label i, i ∈{0, 1} respectively. A graph G is said to be sum cordial graph if it has a sum cordial labeling. The idea of a graph associated to zero-divisors of a ...
6
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
Several result on SD-prime cordial graphs
... SD-prime cordial graphs were discussed in [6, 7, 8, ...the labeling of zero-divisor graphs of commutative ...are sum cordial ...
7
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
Signed Product Cordial of the Sum and Union of Two Fourth Power of Paths and Cycles
... of cordial labeling the product cordial labeling was introduced by Sundaram et al [11] where absolute difference of vertex labels is replaced by product of vertex ...
6
Labeling Techniques of Holiday Star Graph
... Prime labeling and vertex prime labeling are introduced in [16] and ...prime labeling was originated by Ramasubramanian and Kala [15] have proved that paths P n , star K 1,n , bistar, comb, cycles C ...
6
Vol 9, No 8 (2018)
... Fibonacci divisor cordial labeling �𝑒 𝑓 (0) − 𝑒 𝑓 (1)� ≤ 1 ...Fibonacci divisor cordial labeling is called a Fibonacci divisor cordial graph ...
6
Cordiality in the context of duplication in crown related graphs
... Abstract. Let G = (V (G), E(G)) be a graph and let f : V (G) → {0, 1} be a mapping from the set of vertices to {0,1} and for each edge uv ∈ E assign the label | f (u) − f (v)|. If the number of vertices labeled with 0 ...
16
AT MOST EDGE 3 – SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD
... 3-sum cordial graph which admits an edge sum cordial labeling is called at most edge 3-sum cordial ...3-sum cordial labeling is called at most edge ...
11
An square Divisor Cordial Labelling of Graphs
... The divisor cordial labelling is a variant of cordial ...are divisor cordial as all the graphs do not admit divisor cordial ...the divisor cordial labelling ...
7
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
Intuitionistic Fuzzy Divisor Cordial Graph
... Let G = (V(G),E(G)) be a simple graph and f : V(G) → {1 ,2, . . ., | V(G) | } be a function. For each edge uv assign the label 1 if f(u) divides f(v) denoted by f(u) | f(v) or f(v) | f(u) and the label 0, otherwise. Then ...
9
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
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
3-Total Super Sum Cordial Labeling for Union of Some Graphs
... of sum cordial labeling of graph was introduced in [5] and that of k-sum cordial labeling in ...total sum cordial labeling of a graph was introduced in ...
6