Sum cordial labeling of graphs (original) (raw)
Related papers
3-Total Edge Sum Cordial Labeling for Some Graphs
International Journal of Computer Applications, 2015
The sum cordial labeling is a variant of cordial labeling. Here a variant of 3-total sum cordial labeling was introduced and name it as 3-total edge sum cordial labeling unlike in 3-total sum cordial labeling the roles of vertices and edges are interchanged. Here in this paper path graph, cycle graph and complete bipartite graph k 1 , n are investigated on this newly defined concept.
2019
Let G={V,E} be a graph. A mapping f : V(G)→{0,1} is called Binary Vertex Labeling. A Binary Vertex Labeling of a graph G is called a Cordial Labeling if |v_f (0)-v_f (1)|≤1 and |e_f (0)-e_f (1)|≤1. A graph G is Cordial if it admits Cordial Labeling. Here, we prove that Sunlet graph (S_n) and Shell graph C_((n,n-3)) are Cordial and the Splitting graphs of them are also Cordial.
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.
Face Integer Cordial Labeling of Graphs
In this paper, we have introduced and investigated the face integer cordial labeling of wheel W n , fan f n , triangular snake T n , double triangular snake DT n , star of cycle C n and DS(B n,n). Keywords-Integer cordial labeling, face integer cordial labeling, face integer cordial graph.
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.
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.
Face and Total Face Product Cordial Labeling of Graphs
In this paper we introduce two new labeling types, namely face product cordial labeling and total face product cordial labeling and also investigate the face product cordial labeling of fan, M(P n), S′(P n) except for odd n, T(P n), T n , H n , S n except for even n and one vertex union of mC n and C mn and total face product cordial labeling of H n , S n and W n .
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.
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.