defined a new labeling and a new graph called square difference labeling and the square difference graph. Let G be a (p
Square and Cube Difference Labeling of Cycle Cactus, Special Tree and a New Key Graphs
... Abstract. Let G be a (p, q) graph. G is said to be a square difference labeling if there exists a injection f : V(G) → {0,1,2,…,n-1} such that the edge set ...
7
New Results on Labelings of Central Graph of Barbell Graph
... 1.2. Let G be a (p, q) graph. A one-one map f : V(G) → {0, …, p−1} is said to be a square sum labeling if the induced map f * (uv) = (f(u)) 2 + (f(v)) 2 is ...a ...
9
Labeling Techniques of Holiday Star Graph
... 1.8: Let G V E , be a p q , graph, and f be a map from V G to 1, ...2,..., p ...is called a difference cordial labeling if f is a one-to- ...
6
Cube difference labeling of some helm and wheel related graphs
... | P a g e Definition: 1.1: Let 𝐺 = (𝑉, 𝐸) be a ...A difference labeling of G is an injection f from V to the set of non- negative integer with weight function𝑓 ∗ on 𝐸 given by 𝑓 ...
10
SQUARE DIFFERENCE PRIME LABELING –MORE RESULTS ON CYCLE RELATED GRAPHS
... a graph G. The graph whose cardinality of the vertex set is called the order of G, denoted by p and the cardinality of the edge set is called the size of the graph ...
10
Super Mean Labeling and Square Difference Labeling of Some Graphs
... in graph theory. The fact is that graph servers as a mathematical model for any system involving binary ...appeal. Labeling of a graph is an assignment of labels to its vertices (or) and edges ...
5
A Note on Square Sum Difference Product Prime Labeling
... a graph G. The graph whose cardinality of the vertex set is called the order of G, denoted by p and the cardinality of the edge set is called the size of the graph ...
9
On Some Labelings of Subdivision of Snake Graphs
... 1.3. Let G be a (p, q) graph. A one-one map f : V(G) → {0, …, p−1} is said to be a square sum labeling if the induced map f * (uv) = (f(u)) 2 + (f(v)) 2 is ...a ...
10
3-difference cordial labeling of some cycle related graphs
... Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, ...is called a k -difference cordial label- ing of G if ...
10
Absolute Difference of Square Sum and Sum Mean Prime Labeling of Some Path Related Graphs
... Definition: 1.1 Let G be a graph with p vertices and q edges. The greatest common incidence number (gcin) of a vertex of degree greater than or equal to 2, is the greatest common divisor (gcd) ...
5
Edge Odd Graceful Labeling for Different Paths using Padavon Sequence
... graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,…,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the ...
5
Super Face Anti-magic Labeling of Subdivided Prism Graph
... Graph labeling is one major research area in graph ...the graph labeling methods trace their origin to the concept of -valuation introduced by Rosa ...who called it a graceful ...
9
Some Vertex Prime Graphs And A New Type Of Graph Labeling
... [4]T. Deretsky, S. M. Lee, and J. Mitchem, On vertex prime labelings of graphs, in Graph Theory, Combinatorics and Applications Vol. 1, J. Alavi, G. Chartrand,O. Oellerman, and A. Schwenk, eds., Proceedings ...
7
Square Sum Difference Product Prime Labeling of Some Path Related Graphs
... Abstract: Square sum difference product prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with absolute difference of the ...
7
Product fuzzy distance two labeling graph and its properties
... of graph theory for taking care of combinatorial problems in various regions, for example, operation research, structural and electrical engineering, num- ber theory, topology, algebra and computer ...of ...
6
Some Cycle Related 4-cordial Graphs
... Keywords: Abelian group; 4-cordial labeling; middle graph; splitting graph; double wheel; flower graph.. A graph labeling is an assignment of integers to the vertices or edges [r] ...
10
Further Results on Divisor Cordial Labeling
... cordial graphs while K n is 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 al. [14] while some star and bistar ...
10
MEAN SUM SQUARE PRIME LABELING OF SOME CYCLE RELATED GRAPHS
... sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the edges with mean of the square of the sum of the labels of the incident vertices ...
7
k-Product Graph Labeling
... Sum Labeling of Graphs, International Journal of Applied Information Systems (IJAIS) ISSN : 2249- 0868 Foundation of Computer Science FCS, New York, USA Volume 5 - ...
10
K-Contra Harmonic Mean Labeling of Some Graphs
... undirected. Let G be a graph with p vertices and q ...of graph labeling we refer to Gallian 1 ...mean labeling for some standard graphs in ...mean labeling of ...
9