Many algorithms for approximation of restrained ۲-rainbow domination in GP(n,۵)

The concept of ۲-rainbow domination of a graph G coincides withthe ordinary domination of the prism G \Box K_{۲}. Ghanbari andMojdeh \cite{gm} initiated the concept of restrained ۲-rainbowdomination in graphs. In this paper is given many algorithms forgood approximations of restrained ۲-rainbowdomination number of generalized Petersen Graph GP(n,۵).

Keywords:

Petersen , completeness , Complexity , Domination

Authors

Mojtaba Ghanbari

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

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

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

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

https://civilica.com/doc/1599907

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

JR_MSJI-16-1_011

تاریخ نمایه سازی: 17 بهمن 1401

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,1401,Many algorithms for approximation of restrained ۲-rainbow domination in GP(n,۵),https://civilica.com/doc/1599907

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: 456

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.