Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Kh. Erfani"'
Publikováno v:
Iranian Journal of Numerical Analysis and Optimization, Vol 8, Iss 2, Pp 39-54 (2018)
The minimum sum coloring problem (MSCP) is to find a legal vertex coloring for G using colors represented by natural numbers (1,2, . . .) such that the total sum of the colors assigned to the vertices is minimized. The aim of this paper is to present
Externí odkaz:
https://doaj.org/article/6afd4646dd0f40e48f78590709c87764
Publikováno v:
Journal of Applied Mathematics, Vol 2013 (2013)
A new and efficient numerical approach is developed for solving nonlinear Lane-Emden type equations via Bernoulli operational matrix of differentiation. The fundamental structure of the presented method is based on the Tau method together with the Be
Externí odkaz:
https://doaj.org/article/a05e309d99944ec396a8616aad77a40e
Autor:
Kh. Erfani, S. Rahimi Sharbaf
Publikováno v:
Algebraic structures and their applications. 4:33-42
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d65d9652d53ecb06a4db64304daa2945
https://doi.org/10.29252/asta.4.1.33
https://doi.org/10.29252/asta.4.1.33