Certain Domination Parameters and Their Resolving Versions of Fractal Cubic Networks

Networks are designed to communicate, operate, and allocate tasks to respective commodities. Operating supercomputers became challenging, which was handled by the network design commonly known as hypercube, denoted by Qn. In a recent study, the hypercube networks were insufficient to hold supercomputers’ parallel processors. Thus, variants of hypercubes were discovered to produce an alternative to the hypercube. A new variant of the hypercube, the fractal cubic network, can be used as the best alternative in the case of hypercubes. Our research investigates that the fractal cubic network is a rooted product of two graphs. We try to determine its domination and resolving domination parameters, which could be applied to resource location and broadcasting-related problems.