On (2,2)-Domination in Hexagonal Mesh Pyramid

Abstract

Network topology plays a key role in designing an interconnection network. Various topologies for interconnection networks have been proposed in the literature of which pyramid network is extensively used as a base for both software data structure and hardware design. The pyramid networks can efficiently handle the communication requirements of various problems in graph theory due to its inherent hierarchy at each level. Domination problems are one of the classical types of problems in graph theory with vast application in computer networks and distributed computing. In this paper, we obtain the bounds for a variant of the domination problem namely (2,2)-domination for a pyramid network called Hexagonal mesh pyramid.