Edge pair sum labeling
Edge pair sum labeling of some cycle related graphs
... a pair sum labeling, it is called a pair sum ...to pair sum labeling we defined a new labeling called edge pair sum labeling [3] ...
12
Edge pair sum labeling of butterfly graph with shell order
... graph labeling is an assignment of integers to the vertices or edges or both, subject to certain ...of labeling and for a dynamic survey of various graph labeling problems with extensive bibliography ...
6
Pair Sum Labeling of some Special Graphs
... and edge set of a graph G. The pair sum labeling is introduced in [3] by ...the pair sum labeling of cycle, path, star and some of their related graphs like B m,n , K 1,n ...
5
Further Results on Pair Sum Labeling of Trees
... and edge set of a graph ...its edge set is called the size of G and is denoted by q. The concept of pair sum labeling has been introduced ...in[1].The Pair sum ...
9
Super Pair Sum Labeling of Graphs
... graceful labeling of some standard graphs was discussed in ...of pair sum labeling was introduced and studied by ...super pair sum labeling of ...a pair sum ...
10
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, ...each edge uv assigned the label 1 if 2 divides f u ( ) + f v ( ) and 0 ...a sum ...
8
On Super Edge Local Antimagic Total Labeling By Using An Edge Antimagic Vertex Labeling Technique
... super edge local antimagic total labeling of graph ...super edge local antimagic total labeling, thus we have not found any relevant results ...antimagic edge labeling of joint ...
6
Mean Edge-Antimagic Vertex Labeling of Graphs
... graph labeling was introduced by Rosa [4] in 1967. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...vertex labeling is label the vertices with ...
7
Vol 9, No 2 (2018)
... , the set of all non-zero divisors in R and two distinct vertices x and y are adjacent if xy = 0. The complement G of the graph G is the graph with vertex set V(G) and two vertices are adjacent in G if and only if they ...
6
Sum Divisor Cordial Labeling of Theta Graph
... graph labeling, we refer to Gallian [1] . ivisor cordial labeling. , path union of finite copies of is odd ), Jelly fish Ganesan and Balamurugan Our primary objective of this the Theta graph and some graph ...
8
Fuzzification of Some Cycle Related Graphs
... fuzzy labeling. A graph is said to be a fuzzy labeling graph if it has a fuzzy ...digraph labeling. In [5] we introduced a special type of labeling called evidence ...
6
Further Results on Sum Cordial Graphs
... cordial labeling was introduced by Cahit [2] in which he investigated several results on this newly defined ...vertex labeling of a graph G with induce edge labeling f ∗ : E ( G ) −→ { 0, 1 } ...
7
Seav And Semt Labeling For Pvb-Tree
... subpaths attach b pendant edges denoting these pendant vertices by x k ij , i = 1, 2, ..., p, j = 1, 2, ..., v, k = 1, 2, ..., b. The sub paths V are joined one at a vertex of the main path. In this Paper, it is ...
5
SOME GRAPHS WITH SUPER VERTEX SUM NUMBER 2
... vertex sum labeling will be always ...vertex sum label a ...vertex sum label the graph G is called Received: May 3, 2018 c 2018 Academic ...
8
Vol 9, No 2 (2018)
... optimal edge function and its corresponding optimal edge sum function of an edge sum graph and the optimal integral edge function and its corresponding optimal integral ...
7
Edge Mean Labeling Of a Regular Graphs
... As a standard notation, assume that G = G(V, E) is a finite, simple and undirected graph with p vertices and q edges. Terms and terminology as in Harary [3]. Mean labeling was introduced by S.Somasundaram and ...
10
ANTIMAGIC LABELING OF THE UNION OF SUBDIVIDED STARS
... all edge-sums generated by the above formula forms a set of consecutive integer sequence s = α + 2, α + 3, · · · , α + 1 + ...total labeling and we obtain the magic constant a = v + e + s = (10n + 29) ...
7
Absolute Difference of Square Sum and Sum Mean Prime Labeling of Some Path Related Graphs
... square sum and sum mean prime labeling of a graph is the labeling of the vertices with {1,2---,p} and the edges with absolute difference of the mean of the squares of the labels of the ...
5
Existence and Non-Existence of some V4 Cordial graphs
... A graph G is said to be labeled if the n vertices are distinguished from a given set, which induces distinguish edge values satisfying certain conditions. The concept of graceful labeling was introduced by ...
7
AT MOST EDGE 3 – SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD
... a graph G, p and q denote the number of vertices and edges respectively. If the vertices or edges or both of the graphs are assigned values subject to certain conditions, it is known as graph labeling. A detailed ...
11