Papers by nikitha prakash
International journal of pure and applied mathematics, 2018
The neighbourhood prime labelling of a graph G is defined as a function f : V (G) −→ {1, 2, 3, ..... more The neighbourhood prime labelling of a graph G is defined as a function f : V (G) −→ {1, 2, 3, ..., n} which is bijective and if for every vertex of G with degree greater than 1, gcd {f(u) : u ∈ N(v)} = 1. A graph is called neighbourhood prime if it admits neighbourhood prime labelling. In this paper we introduce m-corona and prove that the corona products Pn Pn, the shadow graph of paths Pn, m-corona of paths Pn are all neighbourhood prime graphs. AMS Subject Classification: 05C78
Bookmarks Related papers MentionsView impact
Uploads
Papers by nikitha prakash