اخبار و اعلانات
آمار
| تعداد نشریات | 24 |
| تعداد شماره‌ها | 380 |
| تعداد مقالات | 3,836 |
| تعداد مشاهده مقاله | 5,877,668 |
| تعداد دریافت فایل اصل مقاله | 3,831,267 |
(1702-3501) COVERINGS, MATCHINGS AND PAIRED DOMINATION IN FUZZY GRAPHS USING STRONG ARCS | ||
| Iranian Journal of Fuzzy Systems | ||
| مقالات آماده انتشار، پذیرفته شده ، انتشار آنلاین از تاریخ 03 اردیبهشت 1397 اصل مقاله (372 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22111/ijfs.2018.3839 | ||
| نویسندگان | ||
| O. T. Manjusha* 1؛ M. S. Sunitha2 | ||
| 1Department of Mathematics, Kerala Govt. Polytechnic College, Westhill, Calicut, Kozhikode-673005, India | ||
| 2Department of Mathematics, National Institute of Technology, Cali- cut,, Kozhikode-673 601, India | ||
| چکیده | ||
| The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them anal- ogous to Gallai's results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the strong paired domination number of fuzzy graphs. An upper bound for the strong paired domination number of fuzzy graphs in terms of strong independence number is also obtained. | ||
| کلیدواژه‌ها | ||
| Fuzzy graph؛ Strong arcs؛ Weight of arcs؛ Strong domination؛ Strong paired domination | ||
|
آمار تعداد مشاهده مقاله: 38 تعداد دریافت فایل اصل مقاله: 208 |
||
