An Upper Bound For Restrained double Roman Domination Number In Honeycomb Networks

Honeycomb networks are built recursively using hexagonaltessellations. Wireless networks such as satellite networks, radionetworks, sensor networks, cellular networks, ad hoc networks andother mobile network where honeycomb networks is used extensively.In this paper we study upper bound for restrained double Romandomination number for honeycomb networks.

کلیدواژه ها:

RDRD problem ، Brick structure ، Graph Theory