- 更多网络例句与标号图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
In this paper, the L(d,1)-labeling is studied and the upper bounds of λd of plane triangulation graph, solid tetrahedron subdivision graph, plane near quadrangle subdivision graph are derived, and as corollaries, the conjecture is proved to be true for the above several classes of graphs.
此文研究了作为L(2，1)-标号问题的推广的L(d，1)-标号问题，并得出了平面三角剖分图、立体四面体剖分图、平面近四边形剖分图的L(d，1)-标号的上界，作为推论证明了对上述几类图该猜想成立。
-
First scanning the known handwriting materials then number them ,In pretreatment, we convert the valid part of the image into a standard size, as images carries out duotone and go throw off chirp handling in order to achieve better effect.draw features from the known handwriting materials with the Co-occurence,especially,we divided a copy of handwriting into 25 little pieces with the size of 128*128 ,drawing features from every little piecese with four directions(0 degree, 45 degrees, 90 degrees as well as 135 degrees) and calculate the four major feature values( veins and the statistical quantity of veins contrast and the statistical quantity of veins consistency Shang the statistical quantity of statistical quantity as well as the veins correlation of gray scale ), preservation all the feature value that drawn from all known ma terials to the handwriting characteristic database,then input the unknown handwriting materials, also using the method of the Co-occurence to draw those features, recycling the minimum European Distance law match the unknown writing material feature value with the handwriting characteristic feature database, export the label of the known hand writing materials which is most similar to the unknown material with minimum European Distance, and then we can confirm who is the author of the unknown material.
首先将笔迹材料作为图象扫描输入，并对其进行编号。预处理部分可将笔迹图象的有效部分规范化到一个统一尺寸，接着对其进行二值化和去除噪声的处理，以便于更好的提取图像的特征。在此我们采用了灰度共生矩阵法提取手写笔迹材料的纹理特征，与以往有所不同的是，我们将一份手写材料分割成64块大小为80*80象素的子图象，每个小块都从四个方向（0度、45度、90度以及135度）来更全面的提取特征，并计算出四个最主要的特征值（纹理一致性的统计量、纹理反差的统计量、纹理熵的统计量以及纹理灰度相关性的统计量），将从所有已知材料提取的特征值保存到纹理特征库中，对于待检手写材料，同样采用灰度共生矩阵的方法提取其纹理特征，再利用最小欧氏距离分类法将从待检手写材料中提取的特征值与纹理特征库中的特征值进行比对，与欧氏距离比对值最小的相匹配，输出匹配成功的原材料的标号，进而识别出待检材料书写者的身份。
-
The study on graph labeling is one of the most active subjects in graph theory.
中文摘要：图标号研究是图论中比较活跃的领域之一。
-
Let G = V(G,E be a simple graph with |V| vertices and |E| edges. Let |V|= p,|E|= q, if there exists f: V →{1,2,...,p} be an injective mapping, and define an inducedfunction f":E→{1,2,...,q} by setting f"=|f-f| for all∈E. If f maps E onto {1,2,...,q}, then f is said to be a Skolem-graceful labeling of G, the graph G is said to be a Skolem-graceful graph.
对一个给定的简单图G=V(G，E，|V|和|E|分别是图G的顶点数和边数，令|V|=p，|E|=q，如果存在一个一一映射f：V→{1，2，…，p}，使得对所有边∈E，由f′=|f-f|所导出的映射函数f′：E→{1，2，…，q}是一一对应关系，则称f是图G的一个Skolem优美标号，图G被称为Skolem优美图。
-
For example, if a graph has exactly one cycle, then all graphs in its isomorphism class also have exactly one cycle.
"这一概念图同构"使我们能够区分图形性能固有的结构图自己从性能与图申述：图图，数据结构的图形，图表标号等例如，如果一个图，正是一个周期，然后在其所有图形类也有同构的一个周期。
-
The expression of assembly structure based product structure labeled graph is proposed.The module partition method based on frequent subgraph mining is presented,and Apriori algorithm is applied to build the mapping between frequent subgrahs and product family modules.The structural correlation method of product family is presented,which includes the predefinition of the assembly structure of product family,the definition of the configuration relationships among producy family modules and the definition of the parameter correlations among producy family modules.
以成熟产品设计实例为分析对象，利用产品结构标号图描述其装配结构；提出基于频繁子图挖掘的产品族模块划分方法，建立频繁子图到产品族模块的映射关系；研究了产品族结构关联方法，包括产品族装配结构预定义、产品族配置关系定义和产品族参数关系定义。
-
To prove one edge union of k-shell graph is cordial, firstly fix the labeling of vertex of common edge(label u with 0 and v with 1), then according to the value of the graph order n module 4 to class the k shell gaphs to four cases, and to divide to small cases in every shell graph.
本文研究k-贝壳图的亲切标号时，在固定了公共边上的点的标号(对u标号0且v标号为1)之后，我们采用如下方法：首先，以每个贝壳图的顶点数对4取模的余数来分类，这样就得到了四种(来源：d1ABC论文网www.abclunwen.com)不同情况的贝壳图；然后在每个贝壳图中再分情形进行标号；最后，通过证明得到这种标号方法是满足亲切标号的定义的，从而证明了k-贝壳图的亲切性，成功的解决了Sethuramam和Selvaraju猜想，证明了其正确性。
-
Vertex labeling is a mapping that maps the vertex set into integer set. On the other hand, edge labeling maps edge set into integer set.
一个图的顶点标号是图的顶点集到整数集的映射，而边标号则是图的边集到整数集的映射。
-
Since graceful labeling of graph were introduced by Rosa in the late 1960s, Kotzig and Rosa, Bange et al defined magic labeling ; k-sequential labeling and k-sequentially additive labeling.
自从上世纪60年代末，Rosa引入图的优美标号概念以来，Kotzig和Rosa，Bange等人又定义了图的魔术标号，k-序列标号以及k-序列加法标号。
-
Some necessary conditions are obtained for sequential graphs, regular sequential graphs and Euler sequential graphs; several non-sequential graphs classes are showed for conglutinating graphs. The sequential graphs that contain even cycle with the same vertices have been constructed.
使用这种方法，得到了一般序列图、正则序列图、Euler序列图、圈的粘接序列图和圈的并序列图的必要条件，证明了边数为2k， k是奇数的Euler图是非序列图类，讨论了m个n圈的粘接图中的非序列图类；分析偶圈的特征，构造了偶圈的具有同顶点集的序列母图井给出其序列标号表达式。
- 更多网络解释与标号图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
L'Hospital rule：洛必达规则
l null set l零集 | l'hospital rule 洛必达规则 | labeled graph 标号图
-
labeled graph：标记图
labeled common block 有标号公用块 | labeled graph 标记图 | labeled statement 有标号语句
-
labeled graph：标号图
l'hospital rule 洛必达规则 | labeled graph 标号图 | labile 不稳定的
-
labeled graph：有标号图
"优美树猜想","graceful tree conjecture" | "有标号图","labeled graph" | "拟序集","pre-ordered set"
-
labeled statement：有标号语句
labeled graph 标记图 | labeled statement 有标号语句 | labeling 标号
-
unlabeled graph：无标号图
"唯一分解","unique factorization" | "无标号图","unlabeled graph" | "无扭模","untorsion"