3-Total Edge Product Cordial Labeling of Graphs

Cordial Labeling of Corona Product of Path Graph and Second Power of Fan Graph

“…Similarly, 4 0 1 r L′ is the labeling 0 1100 1100 1100 1 when 1 r ≥ and 01 when 0 r = . Also, we write 0 r for the labeling 0 0 (repeated r-times) and 1 r for the labeling 1 1 (repeated r-times) [7] [8] [9] [10]. For specific labeling L and M of G H where G is path and H is a second fans, we let [ ] ; L M denote the corona labeling.…”

Some new standard graphs labeled by 3–total edge product cordial labeling

“…For each vertex v assign the label by h(e 1 )h(e 2 )...h(e n )(modk) such that e 1 , e 2 , ..., e n are edges incident to v. If |s(x) − s(y)| ≤ 1 for x, y ∈ {0, 1, ..., k − 1} holds then it is called k-total edge product cordial(k-TEPC) labeling. A graph G is k-TEPC if it admits a k-TEPC labeling as proved in [1,11]. Now we will define different family of graphs.…”

“…Azaizeh at al in [1] introduced the concept of 3-TEPC labeling and they proved many results on this newly concept. They discussed 3-TEPC labeling of Path, Circle and Star graphs.…”

3-total edge mean cordial labeling of some standard graphs

“…, e n incident to u, then α is called k-total edge product cordial labeling if it satisfy |s(a) − s(b)| ≤ 1 for all a, b ∈ Z k . For details see [11][12][13][14][15][16][17][18][19].…”