دانشگاه شهید مدنی آذربایجان

آمار

تعداد نشریات7
تعداد شماره‌ها59
تعداد مقالات437
تعداد مشاهده مقاله488,457
تعداد دریافت فایل اصل مقاله344,535
دوره و شماره: دوره 3، شماره 1، تابستان 2018، صفحه 1-91  XML

1

Roman domination excellent graphs: trees

Communications in Combinatorics and Optimization
صفحه 1-24
Vladimir D. Samodivkin

2

Product version of reciprocal degree distance of composite graphs

Communications in Combinatorics and Optimization
صفحه 25-35
K Pattabiraman

3

Total $k$-Rainbow domination numbers in graphs

Communications in Combinatorics and Optimization
صفحه 37-50
Hossein Abdollahzadeh Ahangar؛ Jafar Amjadi؛ Nader Jafari Rad؛ Vladimir D. Samodivkin

4

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

Communications in Combinatorics and Optimization
صفحه 51-70
Behrouz Kheirfam؛ Masoumeh Haghighi

5

Double Roman domination and domatic numbers of graphs

Communications in Combinatorics and Optimization
صفحه 71-77
Lutz Volkmann

6

Mixed Roman domination and 2-independence in trees

Communications in Combinatorics and Optimization
صفحه 79-91
Nasrin Dehgardi


Contact Us | Help & Support | Site Map

Journal Management System. Designed by sinaweb.