着色的
- 与 着色的 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
The concepts of adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence coloring number of graphs are defined on the basis of the concept of incidence coloring of graphs.
在图的关联着色概念的基础上定义了图的邻点可区别关联着色及邻点可区别关联色数,研究了圈、完全二部图、Cm。
-
In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.
本文研究了θ-图的关联着色,定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。
-
In the third chapter, we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs: For graph G, let Q_u={|u"∈N}U{|u∈N},σ: I→C is a k- incidence coloring of graph G, C_u denotes the set of colors assigned to Q_u.
在第三章中我们将定义图的邻点可区别关联着色及邻点可区别关联色数:对图G,设Q_u={|u"∈N}∪{|u∈N},σ:I→C为图G的k-关联着色,C_u表示着在Q_u上的色集。
-
If for any uv∈E, C_u≠C_v, then we callσis a k-adjacent vertex distinguishing incidence coloring of G andχ_=min{k| there exists a k- adjacent vertex distinguishing incidence coloring of G} is the adjacent vertex distinguishing incidence chromatic number of G.
若对任意uv∈E满足C_u≠C_v,则称σ为G的k-邻点可区别关联着色,并称X_=min{k|存在G的k-邻点可区别关联着色}为G的邻点可区别关联色数。
-
In the paper, the via minimization problem in multi layer routing with adjacent constraints is translated to a k colorable problem which has more general meanings, and a mean field annealing algorithm for the k colorable problem is proposed.
该文把具有相邻约束的多层通孔最小化问题转换为更具广泛意义的 k-着色问题,并提出了 k-着色问题的均场退火求解算法。
-
The development of the stainless steel coloration technique was reviewed in this paper.
综述了不锈钢着色技术在国内外的研究进展,讨论了着色技术原理,介绍了彩色不锈钢的优异性能,并对未来这一技术的发展提出了展望。
-
Usually it turns into emerald at the time of chromium oxide or vanadium oxide, while aquamarine is formed due to the coloring of ferrous oxide, it becomes verobieffite due to the existence of magnesium, while heliodor is formed due to the coloring of iron oxide.
在存在氧化铬或氧化钒时通常就成了祖母绿,而海蓝宝石则是由于氧化亚铁着色而成的。成为铯绿柱石是由于镁的存在,而金绿柱石则是因氧化铁着色而成的。
-
This is accomplished by adding the value of the Incandescence channel at the point being shaded to the value of the color channel at the point being shaded.
这是通过在被着色点上增加白炽通道的数值到被着色点的颜色通道来完成的。
-
This paper studies the referee assignment in the course of a single-recycling game by means of theory of edge-colouring and total colouring of graph and gives the optimal results.
应用图的边着色和全着色理论,研究了赛程中的单循环比赛的裁判分派问题,给出了最优分派结果。
-
G, A binders pigmentation is the most often used method.
传统的G、A胶着色工艺是最常用的着色方法。
- 推荐网络例句
-
Plunder melds and run with this jewel!
掠夺melds和运行与此宝石!
-
My dream is to be a crazy growing tree and extend at the edge between the city and the forest.
此刻,也许正是在通往天国的路上,我体验着这白色的晕旋。
-
When you click Save, you save the file to the host′s hard disk or server, not to your own machine.
单击"保存"会将文件保存到主持人的硬盘或服务器上,而不是您自己的计算机上。