CONDITIONAL CONNECTIVITY
CONDITIONAL CONNECTIVITY
复制标题
DOI：
10.1002/net.3230130303
复制
发表时间：
1983-01-01
期刊：
影响因子：
2.1
通讯作者：
HARARY, F
中科院分区：
文献类型：
--
作者：
HARARY, F
对于一个不完全图G，其连通度的传统定义是：去掉G中的点，使G成为一个连通子图，其连通子图的连通度为H1，.，Hk。G关于某个图论性质P的条件连通性是一个点集S的最小基数，如果有的话，使得不连通图G-S的每个分支H i都具有性质P.各种P连通性的问题与已知的连通性和线连通性的结果类似。
For a noncomplete graphG, the traditional definition of its connectivity is the minimum number of points whose removal results in a disconnected subgraph with componentsH1,…,Hk. The conditional connectivity ofGwith respect to some graph‐theoretic propertyPis the smallest cardinality of a setSof points, if any, such that every componentHiof the disconnected graphG‐Shas propertyP.A survey of promising propertiesPis presented. Questions for variousP‐connectivities are listed in analogy with known results on connectivity and line‐connectivity.