排序方式: 共有4条查询结果,搜索用时 8 毫秒
1
1.
2.
图G(V,E)的一个正常k-全染色σ称为G(V,E)的一个k-点强全染色,当且仅当v∈V(G),N[v]中的元素着不同颜色,其中N[v]={u vu∈V(G)}∪{v};并且χvTs(G)=m in{k存在G的一个k-点强全染色}称为G的点强全色数.本文确定了完全图Kn的广义图K(n,m)和乘积图Lm×Kn的点强全色数. 相似文献
3.
A heuristic algorithm is presented for a three-dimensional
off-lattice AB model consisting of hydrophobic (A) and hydrophilic
(B) residues in Fibonacci sequences. By incorporating extra energy
contributions into the original potential function, we convert the
constrained optimization problem of AB model into an unconstrained
optimization problem which can be solved by the gradient method.
After the gradient minimization leads to the basins of the local
energy minima, the heuristic off-trap strategy and subsequent
neighborhood search mechanism are then proposed to get out of local
minima and search for the lower-energy configurations. Furthermore,
in order to improve the efficiency of the proposed algorithm, we
apply the improved version called the new PERM with importance
sampling (nPERMis) of the chain-growth algorithm,
pruned-enriched-Rosenbluth method (PERM), to face-centered-cubic
(FCC)-lattice to produce the initial configurations. The numerical
results show that the proposed methods are very promising for
finding the ground states of proteins. In several cases, we found
the ground state energies are lower than the best values reported in
the present literature. 相似文献
4.
1