adjacent vertex

adjacent vertex的基本解释

-

[计] 相邻顶点

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

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

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.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

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的邻点可区别关联色数。

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

adjacent vertex：相邻顶点

相邻边 adjacent edge | 相邻顶点 adjacent vertex | 关联边 incident edge

adjacent vertex：邻顶

adjacent supplementary angles 邻角 | adjacent vertex 邻顶 | adjoint boundary value problem 伴随边值问题

adjacent vertex：邻顶点

adjacent small side (相邻)直角边 | adjacent vertex 邻顶点 | adjoining 毗邻的,邻接的