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

Author(s):

Mojtaba Ghanbari * , Doost Ali Mojdeh

Message:
Article Type:
Research/Original Article (بدون رتبه معتبر)
Abstract:

Honeycomb networks are built recursively using hexagonal tessellations. Wireless networks such as satellite networks, radio networks, sensor networks, cellular networks, ad hoc networks and other mobile network where honeycomb networks is used extensively. In this paper we study upper bound for restrained double Roman domination number for honeycomb networks.

Keywords:

RDRD problem , Brick structure , Graph Theory

Language:
English
Published:
Theory of Approximation and Applications, Volume:15 Issue: 2, Summer and Autumn 2021
Pages:
118 to 122
https://www.magiran.com/p2424131