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

محورهای موضوعی : Applied Mathematics

Mojtaba Ghanbari ¹ (Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran)
Doost Ali Mojdeh ² (Department of Mathematics, University of Mazandaran, Babolsar, Iran)

تاریخ دریافت : 1400/11/10 تاریخ پذیرش : 1400/12/26 تاریخ انتشار : 1400/09/10

کلید واژه: Graph Theory, RDRD problem, Brick structure,

چکیده مقاله :

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.