P3 Packing Preclusion for Hexagonal Mesh Pyramid
Deeni C.J · International Journal of Computing Algorithm · 2014
Let G be a graph having P3 packing. A P3 packing preclusion number of the graph G is a set of minimum number of edges, whose deletion leaves the resulting graph without a P3 packing. A hexagonal mesh pyramid of n levels denoted as HXPn consists of a set of vertices arranged in n levels of a hexagonal mesh. A vertex with address (k,(x,y,z)) placed at level k, of HXnnetwork is connected to all its adjacent vertices. This vertex is also connected to all the vertices of the hexagon with center (k+1,(x,y,z)). In this paper we find out the P3 packing preclusion of HXPnis trivial.