3-Total Edge Sum Cordial Labeling for Some Graphs

Abstract

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.