A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths and second power of fan graphs explain necessary sufficient conditions for construction cordial.

The study of graph labeling has focussed on finding classes of graphs which admits a particular type of labeling. In this paper we consider a particular class of graph which admits a vertex magic total labeling. The class we considered here is the class of complete graphs, Kn . A vertex magic labeling of a graph is a bijection which maps the vertices V and edges E to the integers from 1, 2, 3, ...

Rank-width is a rather new structural graph measure introduced by Oum and Seymour in 2003 in order to find an efficiently computable approximation of clique-width of a graph. Being a very nice graph measure indeed, the only serious drawback of rank-width was that it is virtually impossible to use a given rank-decomposition of a graph for running dynamic algorithms on it. We propose a new indepe...

Let G = (V,E) be a graph of order p and size q having no isolated vertices. A bijection f : V → {1, 2, 3, ..., p} is called local edge antimagic labeling if for any two adjacent edges e uv e’ vw G, we have w(e) ≠ w(e’), where the weight w(e uv) f(u)+f(v) w(e’) f(v)+f(w). has labeling. The chromatic number χ’lea(G) defined to minimum colors taken over all colorings induced by labelings G. In thi...