triangular sum labeling/graphs
Some Higher Order Triangular Sum Labeling of Graphs
... the graphs that satisfy triangular sum labelings will sat- ify higher order triangular sum labelings ...order triangular sum labeling of standard graphs ...
8
Seventh and Eighth Order Triangular Sum Labeling of Graphs
... order triangular sum labeling if its vertices can be labeled by non negative integers such that induced edge labels obtained by the sum of the labels of end vertices are the seventh (or ...
11
Triangular Difference Graphs
... admit Triangular Difference ...not triangular difference graph and cycle is not Triangular Difference graph when Also admits Triangular Difference labeling iff the set of all first ...
10
On Some Labelings of Subdivision of Snake Graphs
... square sum, square difference, strongly multiplicative labeling for subdivision of triangular snake graph, double triangular snake graph and subdivision of quadrilateral snake graph and double ...
10
Edge pair sum labeling of some cycle related graphs
... pair sum labeling, it is called a pair sum ...pair sum labeling we defined a new labeling called edge pair sum labeling [3] and further studied in ...the ...
12
A Note on Square Sum Difference Product Prime Labeling
... graph labeling is an assignment of integers to the vertices or ...square sum difference product prime labeling and proved that some path related graphs admit this kind of ...related ...
9
Mean Sum Square Prime Labeling of Some Snake Graphs
... graph labeling is an assignment of integers to the vertices or ...of sum square prime labeling and proved the result for some cycle related ...related graphs, some snake related graphs, ...
5
Vol 9, No 8 (2018)
... Graph labeling [3] is a strong communication between number theory [2] and structure of graphs ...the triangular number and divisibility concept in Number Theory and cordial labeling concept ...
6
Some New Results on Sum Divisor Cordial Graphs
... f V G → V G be a bijection. For each edge uv , assign the label 1 if either f u ( ) | f v ( ) or f v ( ) | ( ) f v and the label 0 otherwise. The function f is called a divisor cordial labeling if | e f (0) − e f ...
8
Further Results on Pair Sum Graphs
... The graphs considered here will be finite, undirected and simple. and will denote the vertex set and edge set of a graph G. The cardinality of the vertex set of a graph G is denoted by p and the cardinality of its ...
9
Abstract. In this paper, we investigate the face sum divisor cordial labeling of switching
... face. Also the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1 and the number of faces labeled with 0 and the number of faces labeled with 1 differ by at most 1. A graph with a ...
8
Vol 4, No 11 (2013)
... graph labeling is an assignment of integers to elements of a graph, the vertices or edges, or both subject to certain ...graph labeling was introduced by Rosa in ...magic labeling of graph G = (V(G), ...
9
Some Graph Labeling on Inflated Graph of Triangular Snake and Alternate Triangular Snake Graph
... triangular snake has 4n-4 vertices and (11n-10)/2 edges. To label the vertices, define a map f : V → {0,1} using algorithm 3.7. Thus the number of vertices labeled by ‘1’ and ‘0’ is 2n-2. Hence the number of ...
8
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
Triangular Graphs, Tridi Graphs and Related Aspects
... Proof: Every maximal Outerplanar graph has at least two vertices of degree 2. So there are at least two triangular regions which have two common edges with an exterior region. If two regions have two boundary ...
5
Some Graph Labelings on Middle Graph of Extended Duplicate Graph of a Path
... graph labeling was introduced by Rosa in 1967. A graph labeling is an assignment of integers to the vertices or edges or both subject to certain ...Labeled graphs serve as useful models for broad ...
6
Some Polygonal Sum Labeling of Paths
... graph labeling is regularly updated by Gallian [3] and it is published by Electronic Journal of ...graph labeling and more than 1000 research papers have been published so far in last four ...interesting ...
5
Sum Distance in Fuzzy Graphs
... max{ds(u, v) : v ∈ V }. For a node u, each node at sum distance e(u) from u is an eccentric node for u denoted by u*. G is a unique eccentric node (u.e.n) fuzzy graph if each node in G has a unique eccentric node. ...
17
(a, d) – Edge-antimagic Total labeling in Extended Duplicate Graph of Path
... a labeling we mean one-to-one mapping that carries a set of graph elements onto a set of numbers, called labels (usually the set of ...deal labeling with domain as the set of all ...
5
Signed and Signed Product Cordial Labeling of Cylinder Graphs and Banana Tree
... cordial labeling was introduced by Baskar Babujee ...some graphs is signed product ...k-square graphs, cycle related graphs, some star and bistar related graphs are signed product ...
8