3-Total Edge Sum Cordial Labeling for Some Graphs (original) (raw)

3-Total Edge Sum Cordial Labeling by Applying Union Operation on Path and k 1,n Graphs

2017

In this paper, we have discussed a variant of edge sum cordial labeling of graphs known as 3-Total edge sum cordial labeling of Graphs. Unlike in 3-Total sum cordial labeling the roles of vertices and edges are interchanged. In this paper, this labeling is investigated by applying union operation onPath and k1,n graphs. MSC: 05C76, 05C78.

3-TOTAL Edge Mean Cordial Labeling of Some Standard Graphs

Open Journal of Mathematical Sciences, 2019

In this paper, we introduce new labeling and named it as k-total edge mean cordial (k-TEMC) labeling. We study certain classes of graphs namely path, double comb, ladder and fan in the context of 3-TEMC labeling.

3-Total Super Sum Cordial Labeling by Applying Operations on some Graphs

2016

The sum cordial labeling is a variant of cordial labeling. In this paper, we investigate 3-Total Super Sum Cordial labeling. This labeling is discussed by applying union operation on some of the graphs. A vertex labeling is assigned as a whole number within the range. For each edge of the graph, assign the label, according to some definite rule, defined for the investigated labeling. Any graph which satisfies 3-Total Super Sum Cordial labeling is known as the 3-Total Super Sum Cordial graphs. Here, we prove that some of the graphs like the union of Cycle and Path graphs, the union of Cycle and Complete Bipartite graph and the union of Path and Complete Bipartite graph satisfy the investigated labeling and hence are called the 3-Total Super Sum Cordial graphs.

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

Applied Mathematics and Nonlinear Sciences, 2017

In this paper, we study 3–total edge product cordial (3–TEPC) labeling which is a variant of edge product cordial labeling. We discuss Web, Helm, Ladder and Gear graphs in this context of 3–TEPC labeling. We also discuss 3–TEPC labeling of some particular examples with corona graph.

Sum cordial labeling of graphs

Journal of Mathematical and Computational Science, 2014

In this paper, we investigate the sum cordial labeling of flower graph, web graph, tadpole, triangular snake and shell graph.

Edge product cordial labeling of some graphs

Journal of Applied Mathematics and Computational Mechanics, 2019

For a graph G = (V (G), E(G)) having no isolated vertex, a function f : E(G) → {0, 1} is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex be such that the number of edges with label 0 and the number of edges with label 1 differ by at the most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at the most 1. In this paper we discuss the edge product cordial labeling of the graphs W (t) n , PS n and DPS n .

The total edge product cordial labeling of graph with pendant vertex

IOP Conference Series: Earth and Environmental Science, 2019

One of the topics in graph theory is labeling. The object of the study is a graph generally represented by vertex, edge and sets of natural numbers called label. For a graph G, the function of vertex labeling g : V (G) → {0, 1} induces an edge labeling function g * : E(G) → {0, 1} defined as g * (uv) = g(u)g(v). The function g is called total product cordial labeling of G if |(vg(0) + eg(0)) − (vg(1) + eg(1))| ≤ 1 with vg(0),vg(1),eg(0),and eg(1) respectively are the number of vertex which has label zero, the number of vertex which has label one, the number of edge which has label zero and the number of edge which has label one. All graphs used in this paper are simple and connected graphs. In this paper, we will prove that some graphs with pendant vertex admit total edge product cordial labeling.

Difference Cordial Labeling of Graphs

2013

In this paper, we introduce a new notion called difference cordial labeling. Let G be a ( , ) graph. Let : ( ) → {1, 2, ... , } be a function. For each edge , assign the label | ( )− ( ) |. is called a difference cordial labeling if is a one to one map and (0)− (1) ≤ 1 where (1) and (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial graph.

Further results on total mean cordial labeling of graphs

2015

A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In this paper, we investigate the total mean cordial labeling of Cn2, ladder Ln, book Bm and some more graphs.

Some Results on Total Mean Cordial Labeling of Graphs

viXra, 2015

A graph G = (V,E) with p vertices and q edges is said to be a Total Mean Cordial graph if there exists a function f : V (G) → {0,1,2} such that for each edge xy assign the label l f(x)+f(y) 2 m where x,y ∈ V (G), and the total number of 0, 1 and 2 are balanced. That is |evf(i) − evf(j)| ≤ 1, i,j ∈ {0,1,2} where evf(x) denotes the total number of vertices and edges labeled with x (x = 0,1,2). In this paper, we investigate the total mean cordial labeling behavior of Ln ⊙K1, S(Pn ⊙2K1), S(Wn) and some more graphs.