An Upper Bound For Restrained double Roman Domination Number In Honeycomb Networks
عنوان مقاله: An Upper Bound For Restrained double Roman Domination Number In Honeycomb Networks
شناسه ملی مقاله: JR_MSJI-15-2_009
منتشر شده در در سال 1400
شناسه ملی مقاله: JR_MSJI-15-2_009
منتشر شده در در سال 1400
مشخصات نویسندگان مقاله:
Mojtaba Ghanbari - Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran
Doost Ali Mojdeh - Department of Mathematics, University of Mazandaran, Babolsar, Iran
خلاصه مقاله:
Mojtaba Ghanbari - Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran
Doost Ali Mojdeh - Department of Mathematics, University of Mazandaran, Babolsar, Iran
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
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1634334/