Back close

Neighbourhood Prime Labelling on Some Path Related Graphs

Publication Type : Journal Article

Publisher : International Journal of Pure and Applied Mathematics.

Source : International Journal of Pure and Applied Mathematics, Volume 118, Number 20, p.1893-1901 (2018)

Url : http://www.ijpam.eu

Campus : Kochi

School : School of Arts and Sciences

Department : Mathematics

Year : 2018

Abstract : 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.

Cite this Research Publication : Nikitha Prakash and Supriya Rajendran, “Neighbourhood Prime Labelling on Some Path Related Graphs”, International Journal of Pure and Applied Mathematics, vol. 118, pp. 1893-1901, 2018.

Admissions Apply Now