您要查找的是不是:
- Ordered Adjacency Vertex List Structure for Subdivision Surfaces 细分曲面的有序邻接顶点表数据结构
- A pebbling move on a graph G consists of taking two pebbles off from a vertex and placing one pebble on an adjacent vertex. 摘要在图上进行小石块的移动的步骤为从一个点上取走两个小石块,并在它的某个邻点上放一个小石块。
- adjacent vertex distinguishing total coloring 邻点可区别全染色
- Smarandachely adjacent vertex total coloring Smarandachely邻点全染色
- strong distinguishability at adjacent vertex 邻点强可区别
- adjacency vertex 邻接点
- Situated at the vertex or highest point; directly overhead. 顶点的在顶点或者最高点的; 头的正上方的
- the adjacent vertex distinguishing total chromatic number 邻点可区别全色数
- Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency. 如果在两个图之间存在一个保持邻接性的1-1对应,则这两个图是同构的。
- A(G), D(G) denotes the adjacency matrix and the diagonal matrix of vertex degrees of G, respectively. A(G);D(G)分别表示G的邻接矩阵和度对角矩阵.
- Of or relating to the vertex of the head. 头颅顶的属于头顶的或与其相关的
- Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency . 如果在两个图之间存在一个保持邻接性的1-1对应,则这两个图是同构的。
- A vertex with zero outdegree is called a sink. 出度为零的顶点称作收点。
- Let us label each vertex with a 4 or 3 accordingly. 我们给每一个顶点相应地标上4或3。
- Vertex streams confuse me how do they work? 顶点流数据让我觉得有些糊涂,它们是怎么工作的?
- Another matrix associated with G is the adjacency matrix. 伴随于G的另一个矩阵是邻接矩阵。
- Defines various custom fixed-format vertex types. 定义各种自定义固定格式的顶点类型。
- Vertex format includes a diffuse color component. 顶点格式包括漫射颜色分量。
- Vertex format includes a specular color component. 顶点格式包括反射颜色分量。
- Vertex format includes a vertex normal vector. 顶点格式包括顶点法线向量。