1) friendiy vertex labeling
友好顶点标号
2) friendly labeling
友好标号
3) edge-friendly labeling
边-友好标号
1.
In chapter 4, we define edge-friendly labeling of graph,and obtain the edge-balanceindex sets of the complete bipartite graph Kn,n.
在第四章,定义了图的边-友好标号,得到完全二部图Kn,n的边-平衡指数集,有下面结论:(1)当n为偶数且n≥8时,EBI(Kn,n) = {2n - 8,2n - 9,2n - 10,···,2,1,0}(2)当n为奇数且n≥5时,EBI(Kn,n) = {2n - 4,2n - 6,2n - 8,···,2,0
4) vertex labeling
顶点标号
1.
As the definition of vertex labeling and the construction of graphs,the border value of several vertex labeling graphs and the relationship of k and the side number in graceful graphs included K3 are given.
根据图顶点标号的定义以及图形结构,给出几类图的顶点标号的界值限定及包含三角形K3的(k,d)-优美图中边的条数与k的关系。
5) The Vertex Labeling on Graphs
图的顶点标号
6) friendly index set
友好指标集
1.
By introducing label parameters of graph,this paper gave the friendly index set of generalized wheel W_n~k(n≥3,k≥1),proved that the W_n~(2s) is cordial if n≠2(mod4),and the W_n~(2s+1) is cordial if n≠3(rood4) for natural numbers s≥1,n≥3.
引入标号参数的概念,给出了广义轮图W_n~k(n≥3,k≥1)的友好指标集,证明了对自然数s≥1,n≥3,n≠2(mod4),W_n~(2s)是亲切的;n≠3(mod4),W_n~(2s+1)是亲切的。
补充资料：顶点
①角的两条边的交点；锥体的尖顶。②最高点；极点：比赛的激烈程度达到了～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条