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.

Keywords:

RDRD problem , Brick structure , Graph Theory

Authors

Mojtaba Ghanbari

Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran

Doost Ali Mojdeh

Department of Mathematics, University of Mazandaran, Babolsar, Iran

Certificate
من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

https://civilica.com/doc/1634334

شناسه ملی سند علمی:

JR_MSJI-15-2_009

تاریخ نمایه سازی: 28 فروردین 1402

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:

Ghanbari, Mojtaba and Mojdeh, Doost Ali,1400,An Upper Bound For Restrained double Roman Domination Number In Honeycomb Networks,https://civilica.com/doc/1634334

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of Islamic Azad University of Farahan

Type of center: Azad University

Paper count: 437

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.