摘要
图的边粘连度是反映网络脆弱程度的一个很好的参数,本文主要考察了极大或极小的非边粘连图的必要条件,给出了关于边粘连度的Nordhaus-Gaddum-type结果以及一些图运算下的边粘连度。
Edge-tenacity is a very useful measure of the vulnerability of a network, in particular a communication network,to disruption through the deletion of edges. In this paper, we ?nd the necessory conditions of non-edge tenacious graphs that are maximal or minimal with respect to the edge-tenacity. Furthermore, we give the Nordhaus-Gaddum-type result for edge-tenacity and some oprations of graph with respect to the edge-tenacity.
出处
《工程数学学报》
CSCD
北大核心
2004年第5期704-708,共5页
Chinese Journal of Engineering Mathematics
