顶点的

基本解释 (translations)

apical  ·  climactic  ·  meridian  ·  fastigial

与顶点的相关的网络例句 [注：此内容来源于网络，仅供参考]

For example,we shall be discussing graphs which contain paths which include every edge or every vertex exactly once,ending up at the initial vertex [7];such graphs will be called Eulerian and Hamiltonian graphs respectively.

例如，我们将讨论这样一些图，图中存在包含所有边或所有顶点一次且仅一次而回到出发顶点的路，我们分别称之为欧拉图和哈密尔顿图。

For Example,we shall be discussing graphs which cintain paths which include every edge or every vertex exactly once,ending upa at the initial vertex;such graphs will be called Eulerian and Hamiltonian graphs respectively.

例如，我们将讨论这样一些图，图中存在包含所有边或所有顶点一次且仅一次而回到出发顶点的路，我们分别称之为欧拉图和哈密尔顿图。

The parent element is divided into four sub-areas,and the natural coordinates of the vertices of the sub-areas and the shape functions are used to calculate the temperature at the vertices of corresponding sub-areas in real coordinate system.

首先把母元等分成4个子块，然后利用子块顶点的自然坐标和单元的形函数，求出实际单元中对应子块的顶点温度，利用子块顶点温度判断是否有等值线通过。

The normal and curvature are significant geometry information for 3D point clouds.

差分坐标以其相关之拉普拉斯运算子在三维数位几何模型上已有许多的研究及应用，顶点的差分坐标计算是由顶点与拓扑上之相邻点的相对位置关系所求得，因此顶点之差分坐标代表了区域曲面起伏变化情况，差分坐标其方向会近似於区域法线方向而其长度会近似予区域平均曲率，此两项资讯为点云资料重要几何资讯。

The minimum number of verticesof G whose removal from G results either in a graph that is no longer connected or in a trivial graph with a single vertex: at least K vertices must be removed from a graph with K-connectivity.

从图g中移去顶点使图成为一个非连通图或是单个顶点的"平凡图"的最少顶点数称为连通度。一个k连通度的图至少必须从图g中移去k个顶点才能成为非连通图。

A graph G is called*-choosable if for every list assignment L satisfying L=k for all v 6 V, there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself.

若对任一顶点给定k种颜色的列表，染色时每个顶点的颜色只能从自身的颜色列表中选择且每个顶点至多有d个邻点染相同的颜色，总存在图G的一个顶点的正常着色，则图G称为~*-可选色的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows:(1) Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable.(2) Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,d+d≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下：(1)若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的；(2)若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，d+d≥2n+3，则G是导出匹配可扩的。

Degree sum conditions of IM-extendable graphs are researched. The main results are as follows 1 Let G be a graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,, then G is IM-extendable. 2 Let G be a claw-free graph with 2n vertices. If for each pair of nonadjacent vertices u and v in G,du+dv≥2n+3, then G is IM-extendable.

研究导出匹配可扩图的度和条件，主要结果如下 1若图G有2n个顶点，且对于G中每一对不相邻的顶点u和v，，则G是导出匹配可扩的 2若G是一个有2n个顶点的无爪图，且对于G中每一对不相邻的顶点u和v，du+dv≥2n+3，则G是导出匹配可扩的。

This finds all the edges satisfying the condition that the first vertex index is less than the second vertex index when the direction from the first vertex to the second vertex represents a counterclockwise winding around the triangle to which the edge belongs.

当从第一个顶点到第二个顶点的方向表示该边所属三角形的逆时针方向时找到所有符合第一顶点的索引比第二个顶点索引小的边。

For example, a cube is made up of six quadrilaterals where each vertex is shared by three polygons, but a different normal should be used for each of the three instances of each vertex, but a sphere is made up of many polygons where all vertices have common normals.

例如，一个立方体是由六个四边形组成，而每一个顶点被三个多边形共用，但是每一个顶点的三个实例应该使用不同的法向量，而由许多多边形组成的球，其所有顶点就有同样的法向量。

与顶点的相关的网络解释 [注：此内容来源于网络，仅供参考]

apical：顶上的, 顶点的

wooer 追求者, 求爱者 | apical 顶上的, 顶点的 | spinel type 类晶石型

climactic：顶点的

climacteric 转变期 | climactic 顶点的 | climate 气候

climactic：渐层法的/顶点的/高潮的

climacterium /更年期/ | climactic /渐层法的/顶点的/高潮的/ | climatic /气候的/

Climactic of or forming a climax：顶点的 ; 高潮的

Client a person who pays a professional person , esp . a lawyer , for h... | Climactic of or forming a climax : 顶点的 ; 高潮的 | Cling to held tightly ; stick firmly ; refuse to let go : 紧紧抓住 ; 牢...

climatic：顶点的,高潮的

124. unceasing 永不停息的 | 125. climatic 顶点的,高潮的 | 126. clumsy 笨手笨脚的

culminant：达到顶点的, 绝顶的

culmiferous | 含有碳质页岩的, 生成空心茎的 | culminant | 达到顶点的, 绝顶的 | culminate | 达到顶点

subapical：近顶点的

subaltern 副官 | subapical 近顶点的 | subaquatic 半水生的

subapical：接近顶点的

接近地球的near-earth | 接近顶点的subapical | 接近球形subglobular

subapical：位于顶点下的

subantiparticle 反亚粒子 | subapical 位于顶点下的 | subapical 接近顶点的

subapical：接近顶点的/位于顶点下的

subantiparticle /反亚粒子/ | subapical /接近顶点的/位于顶点下的/ | subaquatic /半水生的/