谷歌浏览器插件
订阅小程序
在清言上使用

Edge Neighbor Toughness of Graphs

Xin Feng,Zongtian Wei, Yucheng Yang

Axioms(2022)

引用 0|浏览2
暂无评分
摘要
A new graph parameter, edge neighbor toughness is introduced to measure how difficult it is for a graph to be broken into many components through the deletion of the closed neighborhoods of a few edges. Let G=(V,E) be a graph. An edge e is said to be subverted when its neighborhood and the two endvertices are deleted from G. An edge set S⊆E(G) is called an edge cut-strategy if all the edges in S has been subverted from G and the survival subgraph, denoted by G/S, is disconnected, or is a single vertex, or is. The edge neighbor toughness of a graph G is defined to be tEN(G)=minS⊆E(G){|S|c(G/S)}, where S is any edge cut strategy of G, c(G/S) is the number of the components of G/S. In this paper, the properties of this parameter are investigated, and the proof of the computation problem of edge neighbor toughness is NP-complete; finally, a polynomial algorithm for computing the edge neighbor toughness of trees is given.
更多
查看译文
关键词
graph,edge neighbor toughness,NP-complete,polynomial algorithm,tree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要