>
Fa
  |  
Ar
  |  
En
  
communications in combinatorics and optimization
  
سال:2017 - دوره:2 - شماره:2
  
 
approximation solutions for time-varying shortest path problem
- صفحه:139-147
  
 
graceful labelings of the generalized petersen graphs
- صفحه:149-159
  
 
on leap zagreb indices of graphs
- صفحه:99-117
  
 
primal-dual path-following algorithms for circular programming
- صفحه:65-85
  
 
reformulated f-index of graph operations
- صفحه:87-98
  
 
some results on the complement of a new graph associated to a commutative ring
- صفحه:119-138
Copyright 2023
Islamic World Science Citation Center
All Rights Reserved