摘要
文章讨论了边连通简单图的独立数与上可嵌入性的关系,得到了下列结果:(1)设G是一个k-边连通简 单图(k=1,2),若α(G)≤k,则G是上可嵌入的;(2)设G是一个3-边连通简单图,若α(G)≤5,则G是上可嵌入 的。
This paper investigates the relationship between the independent number and the upper embedability of the edge - connected simple graph and obtains the following results: (1) Let be a - edge - connected simple graph with, then is upper - embed-able; (2) Let be a 3 - edge - connected simple graph with , then is upper - embeddable.
基金
国家自然科学基金(10271048)
关键词
简单图
独立数
上可嵌入性
连通
graph
maximum genus
Betti deficiency
upper - embedable
independent number
