## sum combination-2 cordial labeling

## Main Article Content

## Article Sidebar

**Published**Aug 4, 2021

## Abstract

Graphs we are used in this article is simple undirected without multiple edges or loops.Graph labelling is a vast area in research.Labeled graphs are used in various scientific and technical fields.Labeling of a graph is used in various fields like networking, tele -communication, crystallography etc.In this paper the graph is G= (V, E) be a graph with p be the number of vertices and q be the number edges .Graph labeling is an assignment of integers either to the vertices or edges or both of them subject to certain conditions. Many labeling concepts were introduced throughout these years, most techniques were introduced by Rosa [6] in 1967 we can see an excellent survey of graph labelling by Gallian in [2].I.Cahit [1] introduced the concept of cordial labeling as a weaker version of graceful and harmonious labeling. A cordial labeling in which graph takes values and the edge takes values as the difference then the number of edges and vertices having values 0 and 1 and respectively. Then this graph is called cordial graph

Combination is a technique in which we can make maximum possible arrangements of a system,without repetition .Combination can be used in many real life situation also.Combination labeling was introduced by hedge et.al in [3] as there exists a bijection ₤ : V (G) → {1, 2, 3, ..., p} such that the induced edge function g : E(G) → N defined as , is injective, where is the number of combinations of f(u) things taken ₤(v) at a time. Such a labeling ₤ is called combination labeling of G.They also proved many graphs holding this property .

In [4] R .Ponraj et.al introduced the concept of parity combination cordial labelling. For each edge uv, assign the label or according as u >v or v > u. ₤ is called a parity combination cordial labeling (PCC-labeling) if f is a one to one map and where and denote the number of edges labeled with an even number and odd number, respectively. Mohamed Seoud et.al[4] later developed this labelling technique to some more graphs.we can see different kind of graphs holding this techniques in this articles.

Taking inspiration from these techniques we are considering the sum of two function holds the cordial labelling.Now we are taking the possibilities of a particular function sum combination- 2 in cordial labeling.We are also checking the possibilities of the graphs holding this labelling. The sum combination -2 labeling of the graph G=(p,q) be a graph and the function ₤:V(G)→p is an bijective mapping has the value and the condition ,where is the number of edges labeled with even numbers and is the number of edges labelled with odd numbers.Then it is called sum combination-2 cordial labelling and the graph is called sum combination-2 cordial graph. Below we can see a graph ⊚ holding the sum combination-2 labeling.

Now we are taking certain graphs that hold sum combination-2 labeling technique.

## How to Cite

*SPAST Abstracts*,

*1*(01). Retrieved from https://spast.org/techrep/article/view/79

## Article Details

graph labeling, combinatorial labeling, sum combination

[2]J.A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16 2019, # Ds6

https://www.combinatorics.org › ojs › download › pdf

[3] S.M.Hegde and Sudhakar Shetty, Combinatorial Labelings of Graphs, Applied Mathematics ENotes, 6(2006), 251-258.

[4]Mohamed Seoud and Mohamed Aboshady, Further results on Parity Combination Cordial Labeling, Journal of the Egyptian Mathematical Society, 2020 28:25,

https://doi.org/10.1186/s42787-020-00082-8

[5] R.Ponraj, S. Sathish Narayanan and A.M.S. Ramasamy, Parity combination cordial labeling of graphs, Jordan Journal of Mathematics and Statistics (JJMS) , 8(4),2015, 293-308.

https://www.researchgate.net/publication/299031186_Parity_combination_cordial_labeling_of_graphs

[6] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris (1967) 349-355.