>
Fa
|
Ar
|
En
communications in combinatorics and optimization
سال:2018 - دوره:3 - شماره:1
an infeasible interior-point method for the p*-matrix linear complementarity problem based on a trigonometric kernel function with full-newton step
- صفحه:51-70
double roman domination and domatic numbers of graphs
- صفحه:71-77
mixed roman domination and 2-independence in trees
- صفحه:79-91
product version of reciprocal degree distance of composite graphs
- صفحه:25-35
roman domination excellent graphs: trees
- صفحه:1-24
total k-rainbow domination numbers in graphs
- صفحه:37-50
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved
