Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
A decomposition of a graph is a list of subgraphs such that each edge appears in exactly one subgraph If each is a neighborhood prime graphs then is called a neighborhood prime decomposition (NPD) of G. The minimum cardinality of NPD is called a NPD number of G and it is denoted by In this paper, we investigate NPD of the cycle book graph , jelly fish graph pineapple graph and windmill graph