哈密尔顿,Hamilton英语短句,例句大全

哈密尔顿,Hamilton
1)Hamilton[英]['h?milt?n][美]['h?ml?t?n]哈密尔顿
1.A Sufficient Condition for Hamilton K_1,m-free Graphs;关于无爪图的哈密尔顿性的一个充分条件
2.For a simple graph G=(V,E),Ore theorem states that G is Hamiltonian if every pair of nonadjacent vertices u and v satisfies d(u)+d(v)≥|V|.对简单图 G=(V,E) ,Ore定理告诉我们 :如果对 G的每一对不相邻的顶点 u,v都有 d(u) +d(v)≥ |V|,则G有哈密尔顿圈。

英文短句/例句

1.Hamiltonicity of Transformation Graph G~(+--);变换图G~（+--）的哈密尔顿性
2.Connectivity, Cutsets and Hamiltonian Cycles of Johnson Graphs;Johnson图的连通度、割集和哈密尔顿圈
3.Neighborhood Union Conditions for Hamiltonicity of P3-dominated GraphsP3-支配图哈密尔顿性的邻域并条件
4.Establishment of Weak Formulation for the Dual System of Hamilton Equations对偶体系弱形式哈密尔顿方程的建立
5.A Neighborhood Condition for Quasi Claw-free Hamiltonian Graphs拟无爪哈密尔顿图的邻集条件(英文)
6.Conservation and Symplectic Properties of Continuous Finite Element Methods for Hamiltonian Systems;哈密尔顿系统有限元的守恒性和辛性质
7.N-Factor-Criticality and Hamilton-Connectivity in Graph Theorey;图论中的N-因子-临界性与哈密尔顿连通性
8.Cyclical Edge-connectivity, Resonance and Hamiltonicity of Fullerene Graphs on Surfaces;曲面Fullerene图的环边连通度、共振性及哈密尔顿性
9.Homogenization of Monotone Systems of Non-coercive Hamilton-Jacobi Equations非强制单调哈密尔顿雅可比系统的齐次化
10.Existence of Periodic Solution for Second-Order Discrete Hamiltonian Systems二阶离散哈密尔顿系统周期解的存在性(英文)
11.Two Sufficient Conditions for P_3-dominated Hamiltonian GraphsP_3-支配图哈密尔顿性的两个充分条件(英文)
12.The opposition of views between Mr. Hamilton and himself was unpleasant.哈密尔顿先生和他本人之间的意见冲突令人不快。
13.Basic Property of Material and Hamilton Real-time Simulation Data Bank of Multi-alloy材料的基础性质和多体合金哈密尔顿实时模拟数据库
14.In the second chapter, we give a sufficient condition for a 4-connected graph to be Hamiltonian.在本文的第二部分，我们讨论了4-连通图的哈密尔顿性。
15.Applications of Variational Methods in the Periodic Boundary Value Problems of Discrete Hamiltonian Systems;变分法在离散哈密尔顿系统周期边值问题中的应用
16.Hamiltonian Connectivity, Pancyclicity and Edge Deletion Preserving the Diameter of Johnson GraphsJohnson图的哈密尔顿连通性、泛圈性和删边保持直径不变性
17.Limit Cycles of Some Z_3-Equivariant Near-Hamiltonian Polynomial Systems几类Z_3等变近哈密尔顿多项式系统的极限环的个数
18.There are some commercialized islands with luxury resorts, like Hamilton, Hayman and Mole.这儿有一些商业色彩很浓的岛屿，有豪华的旅游胜地，如哈密尔顿岛，希曼岛和堤岛。

相关短句/例句

Hamilton graph哈密尔顿图
1.By using Hamilton graph,the problem of wagons placing-in and taking-out on branch-shaped sidings can be turned into searching Hamilton loop of minimum power.运用图论中的哈密尔顿图,可以将树枝型专用线取送车问题,转化为求哈密尔顿图中权值最小的哈密尔顿回路问题。
2.he concept of the degree of a face is introduced, associated theoreme as necessary conditions of Hamilton graph are presented, and a method to search for Hamilton circuits in a given connected planer graphabsorbing transformation of graph-is Put forward.本文引进面的度数这一概念，给出作为哈密尔顿图的必要条件的伴随定理，提出一个在给定的连通平面图上找哈密尔顿回路的方法──图的吸收变换法。
3.By adopting Hamilton Graph, the paper builds up a mathematical model for wagons’ placing-in and taking-out and goods loading & unloading operation.运用图论中的哈密尔顿图,建立取送及装卸作业的数学模型,从整体取送车作业过程来分析,将树枝型专用线的取送车问题,转化为寻求哈密尔顿图回路机车作业时间最短方案的最优问题。
3)Hamilton cycle哈密尔顿图
1.Moreover, the conjecture in the case of a block with cyclomatic number 2 is confirmed by constructing a Hamilton cycle.本文给出了“简单图的邻接树图是哈密尔顿图”猜想的等价命题 ,阐明只需证明该猜想对 2 -连通图成立即可。
4)Hamiltonicity哈密尔顿性
1.Hamiltonicity,neighborhood union and square graphs of claw-free graphs;哈密尔顿性、邻域并和无爪图的平方图(英文)
2.Degree Sum of Independent Sets and Hamiltonicity of Graphs;独立集的度和与图的哈密尔顿性
3.It is well-known that the problem on hamiltonicity of graphs is a very important problem in graph theory and the research is very active.众所周知，图的哈密尔顿性问题一直是图论中的一个十分重要且又十分活跃的研究课题。
5)Hamiltonian graph哈密尔顿图
1.A New Sufficient Conditions and Hamiltonian graphs;新的充分条件和哈密尔顿图
2.3 +e,P 4}, the following new localized result on hamiltonian graphs is obtained.3 +e ,i=1,2 ,则G为哈密尔顿图。
6)hamiltonian[英][,h?mil't?uni?n][美][,h?ml?'ton??n]哈密尔顿图
1.Let α to be independence number of graph G, in 1984 Fan showed: Let G be a 2-connected graph of order n, for every pair vertices x,y of d(x,y)=2, if max{d(x),d(y)}≥n/2, then G is Hamiltonian.1984年,Fan给出了著名的Fan定理:若2连通n阶图G的距离是2的任意两点x、y均有max{d(x),d(y)}≥n/2,则G是哈密尔顿图。
2.In 1991 Faudree et al obtained the 2-connected graph of order n with NC≥n-δ,then it is Hamiltonian.Faudree等在 1991年得到 N C≥ n -δ条件下熟知的哈密尔顿性结果 ,其后 ,一些论文研究 N C2 ≥ n -δ的哈密尔顿图性。