Upper bounds for ۲-restrained domination number of GP(n,۲)

Ghanbari and Mojdeh \cite{gm} initiated the concept of restrained۲-rainbow domination in graphs. In this paper is given upperbounds for ۲-restrained domination number of a particular case ofgeneralized Petersen graphs.

Keywords:

Generalized , Petersen , Domination

Authors

Mojtaba Ghanbari

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

Mehdi Jalinoosi

Department of Mathematics, University of Gom, Gom, Iran

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

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

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

https://civilica.com/doc/1634354

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

JR_MSJI-16-2_001

تاریخ نمایه سازی: 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 Jalinoosi, Mehdi,1401,Upper bounds for ۲-restrained domination number of GP(n,۲),https://civilica.com/doc/1634354

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.