Edge product cordial labeling of graphs

By Samir Vaidya, C. Barasara. 2012

48 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/b186c1852d6e852db450dd41122c487eba63e632

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Joseph A. Gallian

Citations in the corpus

• A Dynamic Survey of Graph Labeling (2009, background): “In [1703], [1705], [1706], [1707] and [1710] Vaidya and Barasara proved the following graphs are edge product cordial: Cn for n odd; trees with order greater than 2; unicyclic graphs of odd order; C (t) n , the one point union of t copies of Cn for t even or t and n both odd; Cn K1; armed crowns; he”