Many algorithms for approximation of restrained ۲-rainbowdomination in GP(n, ۳)
Publish place: The first national conference on intelligent systems, soft computing and applied mathematics
Publish Year: 1401
نوع سند: مقاله کنفرانسی
زبان: English
View: 71
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
FSSAC01_006
تاریخ نمایه سازی: 8 آذر 1402
Abstract:
Ghanbari and Mojdeh [۷] initiated the concept of restrained ۲-rainbow domination ingraphs. Ghanbari [۵] and [۶] approximated the Upper bounds for ۲-restrained dominationnumber of GP(n, ۲) and GP(n, ۵). In this paper is given upper bounds for ۲-restraineddomination number of an other particular case of generalized Petersen graphs
Keywords:
Authors
M. Ghanbari
Department of Mathematics, Farahan Branch, Islamic Azad University, Farahan, Iran