A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

The total product cordial labeling is a variant of cordial labeling. We introduce an edge
analogue product cordial labeling as a variant of total product cordial labeling and name it …

In this paper we study 3-total edge product cordial (3-TEPC) labeling of some new classes of
graphs. We study ladder graph, wheel graph, m isomorphic copies of n–cycle graph and …

On 3-total edge product cordial labeling of tadpole, book and flower graphs Page 1 Article
On 3-total edge product cordial labeling of tadpole, book and flower graphs Umar Ali1, Yasir …

3-TOTAL EDGE PRODUCT CORDIAL LABELING OF GRAPHS Page 1 Far East Journal of
Mathematical Sciences (FJMS) © 2015 Pushpa Publishing House, Allahabad, India Published …

We begin with simple, finite, connected and undirected graph))(),((= GEGV G. We will give
brief summary of definitions and other information which are useful for the present …

In this paper, a technique of coding a message using GMJ code on the Fibonacci web FW (t,
n) by applying the difference cordial labeling is provided. A few observations and a rule for …

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 …

3-total edge mean cordial labeling of some standard graphs Page 1 Article 3-total edge mean
cordial labeling of some standard graphs Fakhir Aslam1, Zohaib Zahid1,∗ and Sohail Zafar1 1 …

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 …