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

哈密尔顿性,Hamiltonicity
1)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.众所周知，图的哈密尔顿性问题一直是图论中的一个十分重要且又十分活跃的研究课题。

英文短句/例句

1.Hamiltonicity of Transformation Graph G~(+--);变换图G~（+--）的哈密尔顿性
2.Neighborhood Union Conditions for Hamiltonicity of P3-dominated GraphsP3-支配图哈密尔顿性的邻域并条件
3.Cyclical Edge-connectivity, Resonance and Hamiltonicity of Fullerene Graphs on Surfaces;曲面Fullerene图的环边连通度、共振性及哈密尔顿性
4.Two Sufficient Conditions for P_3-dominated Hamiltonian GraphsP_3-支配图哈密尔顿性的两个充分条件(英文)
5.In the second chapter, we give a sufficient condition for a 4-connected graph to be Hamiltonian.在本文的第二部分，我们讨论了4-连通图的哈密尔顿性。
6.ON HAMILTONIAN PROPERTY AND CONNECTIVITY OF THE CARTESIAN PRODUCT OF INFINITE GRAPHS无限图的笛卡尔积的哈密顿性和连通性
7.Conservation and Symplectic Properties of Continuous Finite Element Methods for Hamiltonian Systems;哈密尔顿系统有限元的守恒性和辛性质
8.N-Factor-Criticality and Hamilton-Connectivity in Graph Theorey;图论中的N-因子-临界性与哈密尔顿连通性
9.Existence of Periodic Solution for Second-Order Discrete Hamiltonian Systems二阶离散哈密尔顿系统周期解的存在性(英文)
10.Hamiltonian Connectivity, Pancyclicity and Edge Deletion Preserving the Diameter of Johnson GraphsJohnson图的哈密尔顿连通性、泛圈性和删边保持直径不变性
11.Connectivity, Cutsets and Hamiltonian Cycles of Johnson Graphs;Johnson图的连通度、割集和哈密尔顿圈
12.Establishment of Weak Formulation for the Dual System of Hamilton Equations对偶体系弱形式哈密尔顿方程的建立
13.A Neighborhood Condition for Quasi Claw-free Hamiltonian Graphs拟无爪哈密尔顿图的邻集条件(英文)
14.Basic Property of Material and Hamilton Real-time Simulation Data Bank of Multi-alloy材料的基础性质和多体合金哈密尔顿实时模拟数据库
15.ON THE HERMITIAN OF THE HAMILTONIAN OF RADIAL EQUATION关于径向方程哈密顿量的厄米性问题
16.Hamilton Cycles and List Linear Arboricity of Graphs;图中的哈密顿圈和图的列表线性荫度
17.A method of Hamiltonian system for viscous fluid in lid-driven cavities空腔内粘性流问题与哈密顿体系方法
18.Homogenization of Monotone Systems of Non-coercive Hamilton-Jacobi Equations非强制单调哈密尔顿雅可比系统的齐次化

相关短句/例句

Hamilton property哈密尔顿性质
1.In this paper, we investigate the Hamilton property of primitive digraph with given exponent.本文研究了给定指数n+s(n-2)的本原有向图的哈密尔顿性质,并得到如下结果:(1)设D是围长为s≥2,指数为n+s(n-2)的n阶本原有向图,如果D中有一个r-圈,使降(r,s)=1。
3)Hamiltonian laceable哈密尔顿可迹性
4)Hamiltonian-connectivity哈密尔顿连通性
5)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有哈密尔顿圈。
6)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.运用图论中的哈密尔顿图,建立取送及装卸作业的数学模型,从整体取送车作业过程来分析,将树枝型专用线的取送车问题,转化为寻求哈密尔顿图回路机车作业时间最短方案的最优问题。