1) upper embeddability
上可嵌入性
1.
The New Neighbor Condition and the Upper Embeddability of Graphs;
新邻域条件与图的上可嵌入性
2.
This paper studies the relationship between the upper embeddability of graphs and independent number,the degree sum of nonadjacent vertices,obtains some new classes of upper embeddable graphs,and generalizes a relevant result.
本文研究了图的上可嵌入性与独立数、非邻节度点和之间的关系,得到了一些新的上可嵌入图类,推广了—个相关结果。
3.
By adding some restricted conditions for edges of a graph,this paper further studies the upper embeddability of graphs with diameter three or four,and obtains some new upper embeddable graphs.
通过对边添加一些限制条件,进一步研究了直径为3和4的图的上可嵌入性,得到了一些新的上可嵌入图类。
3) non upper embeddability
不可上嵌入性
5) upper embeddable
上可嵌入
1.
Y·Liu and L·Nebseky have respectively given a sufficient and necessary condition on upper embeddable graphs.
自从Nordhaus等引入图的最大亏格以来,图的最大亏格以及图的上可嵌入引起了广泛关注。
2.
A graph is said to be upper embeddable if there exists a 2 cellular embedding on the orientable surface with one or two face.
若图G可2胞腔嵌入到可定向曲面S上,且G嵌入S后至多只有2个面,则称G在S上是上可嵌入的。
3.
Nebseky have respectively given a sufficient and necessary condition on upper embeddable graphs;Y.
关于图的上可嵌入性,刘彦佩和Nebseky分别给出不同形式的充要条件,黄元秋从另一相反角度出发,提供了一个关于不是上可嵌入图的充要条件。
6) upper embeddability
上可嵌入
1.
Combined with the relationship between the upper embeddability of graphs and the max degree of vetex in cycle,this paper proves the following results by using a sufficient and necessary condition on non-upper embeddable graphs:(1) Let G be a 2-edge-connected simple graph.
本文利用非上可嵌入图的充要条件,结合圈中顶点最大度与图的上可嵌入性之间的关系,得到了如下两个结果:(1)设G是2-边连通简单图,若对G中任意圈C,存在点x∈C满足:d(x)>3/|V(G)|+1,则图G是上可嵌入的,且不等式的下界是不可达的。
补充资料：连续性与非连续性(见间断性与不间断性)
连续性与非连续性(见间断性与不间断性)
continuity and discontinuity
11an父ux泊g四f“山。麻以角g、.连续性与非连续性(c。nt，n琳t:nuity一)_见间断性与不间断性。and diseo红ti-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条