搜索结果: 1-1 共查到“微分拓扑学 Graphs”相关记录1条 . 查询时间(0.062 秒)
Upper bounds for the bondage number of graphs on topological surfaces
Bondage number Domination number Topological surface
font style='font-size:12px;'>
2011/2/22
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having...