说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 最小Hamilton路
1)  Minimum-Hamilton Path
最小Hamilton路
2)  analysis at the opposite angles of a rectangle
最优Hamilton回路
3)  Hamilton path
Hamilton路
1.
Hamilton paths in Z-transformation graphs of polyomino graphs
四角系统的Z-变换图的Hamilton路
2.
Though considering the in-degree sequence of T-i, for every i∈{1,2,:,s}, this paper gives a lower bound of the number of Hamilton path for tournament T.
本文通过考虑每个Ti的入度序列给出了T中Hamilton路数的一个下界。
3.
Authors discuss the Hamiltonian property of Cartesiam product (C_n)×(C_m) about two directed cycles (C_n)and(C_m), give and show that: (C_n)×(C_m) has a directed Hamilton path,but not has generally a directed Hamilton cycle.
讨论两个有向圈Cn与Cm的卡氏积图Cn×Cm的Hamilton性,给出并证明了:Cn×Cm存在有向Hamilton路,但未必存在有向Hamilton圈;当n|m时,Cn×Cm必存在有向Hamilton圈。
4)  Hamilton-path
Hamilton-路
5)  Hamiltonian path
Hamilton路
1.
A Matrix Solution to Hamiltonian Path of any Graph;
Hamilton路的矩阵求法
2.
A sufficicent and necessary condition for digraph having Hamiltonian path by use of the defintion of U-track and a sufficient condition for strictly directed bipartite graph to be hamiltonian by use of the definition of Hamiltonian path are proved.
 对图的邻接矩阵赋予U-轨道的定义和严格有向二部图的定义,利用U-轨道的定义和Hamilton路的定义论证了严格有向图含有向Hamilton路的充要条件和严格有向二部图为Hamilton图的充分条件。
3.
A sufficient condition of strictly directed bipartite graph with directed Hamiltonian path is given, that is, suppose that D is a strictly directed Bipartite graph on n vertices, (in it V(D)=(X,Y),‖X|-|Y‖≤1), if two arbitraily nonadjacent vertices x,y in V(D) have d(x)+d(y)≥2n-4, then D has directed Hamiltonian path.
 给出了严格有向二部图含有向Hamilton路的一个充分条件,即:设D是n阶严格有向二部图(其中V(D)=(X,Y),‖X|-|Y‖≤1),若V(D)中任两个不相邻的顶点x,y,都有d(x)+d(y)≥2n-4,则D含有向Hamilton路。
6)  minimal path sets
最小路集
1.
Optimized method for calculating minimal path sets of large-scale network system;
大型网络系统最小路集的优化计算方法
2.
Methods of system reliability synthesis based on minimal path sets
基于最小路集的系统可靠性综合方法
3.
A new method of Bayesian reliability confidence limit assessment based on minimal path sets was put forward.
阐述了复杂系统的Bayes置信限评估原理,并将其与最小路集求可靠度函数的方法相结合,对已知系统可靠性框图或可靠度函数的复杂系统进行可靠度置信限评估。
补充资料:克罗米通 ,优乐散,优力斯,巴豆酰甲苯胺
药物名称:克罗米通

英文名:Crotamiton

别名:克罗米通 ,优乐散,优力斯,巴豆酰甲苯胺
外文名:Crotamiton,Eurax
适应症: 用于疥疮。
用量用法:
治疗前洗澡,揩干,将本品从颏下涂搽全身皮肤,特别在皱折、手足、指趾间、潮湿部位如腋下和腹股沟;24小时后涂第2次,再隔48小时洗澡将药洗去,穿上干净衣服,更换床单等;配偶和家中同患者同治。对顽固病例,1周后重复1次;亦有人主张每天涂搽1次,连续5-7天。
注意事项: 可引起接触性皮炎,急性炎症性糜烂或渗出性皮肤损害禁用;勿接触眼睛和粘膜;若误服本品,应立即洗胃。
规格: 克罗米通霜剂。软膏剂:10%.



类别:皮肤病用药
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条