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

الموضوعات :

Mojtaba Ghanbari ¹ , Doost Ali Mojdeh ²

1 - Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran
2 - Department of Mathematics, University of Mazandaran, Babolsar, Iran

تاريخ الإرسال : 27 الأحد , جمادى الثانية, 1443 تاريخ التأكيد : 14 الخميس , شعبان, 1443 تاريخ الإصدار : 26 الأربعاء , ربيع الثاني, 1443

الکلمات المفتاحية: 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.