Abstract
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 hex-agonal 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
