This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs

No abstract

No abstract

A vertex labeling of graph G is a function f: V(G)  {-1,1} with an induced edge labeling f*: E(G)  {-1,1} defined by f*(uv) = f(u)f(v) is called a signed product cordial labeling if |vf(-1)-vf(1)| ≤ 1 and |ef*(-1)-ef*(1)| ≤ 1, where vf(-1) and vf(1)are the number of vertices labeled with-1 and +1 respectively and ef*(-1) and ef*(1)are the number of edges labeled with-1 and +1 respectively. A graph G is signed product cordial if it admits signed product cordial labeling. In this paper we proved the existence of signed product cordial labeling for some families of graphs.