Article citationsMore>>

Vaidya, S.K. and Prajapati, U.M. (2013) Prime Labeling in the Context of Duplication of Graph Elements. International Journal of Mathematics and Soft Computing, 3, 13-20.

has been cited by the following article:

• TITLE: Edge Product Cordial Labeling of Some Cycle Related Graphs

  AUTHORS: Udayan M. Prajapati, Nittal B. Patel

  KEYWORDS: Graph Labeling, Edge Product Cordial Labeling

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.6 No.4, September 9, 2016

  ABSTRACT: For a graph having no isolated vertex, a function 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 is such that the number of edges with label 0 and the number of edges with label 1 differ by at most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at most 1. In this paper, we discuss edge product cordial labeling for some cycle related graphs.