Phosphoproteomics analysis of transformation potential of the epstein-barr virus-encoded latent membrane protein 1 in nasopharyngeal epithelial cells NP69
- 作者：Jie Qiong Liu ; Qiong Zhang ; Sha Sha Fang ; Yan Hui Yu ; Zhi Qiang Xiao ; Zhu Chu Chen ; Zhi Min He
- 关键词：Connectivity ; Superconnectivity ; Cutset ; Diameter ; Girth
- 刊名：Cell Biology International
- 出版年：2008
- 期刊代码：164_10656995
- 类别：bio
- 出版时间：March 2008
- 卷：32
- 期：3
- 页码：S27-S28
- 文件大小：67 K
摘要
For a connected graph G, the rth extraconnectivity κr(G) is defined as the minimum cardinality of a cutset X such that all remaining components after the deletion of the vertices of X have at least r+1 vertices. The standard connectivity and superconnectivity correspond to κ0(G) and d05428f732ba4fa15e038a6f1e57ee9" title="Click to view the MathML source" alt="Click to view the MathML source">κ1(G), respectively. The minimum r-tree degree of G, denoted by ξr(G), is the minimum cardinality of N(T) taken over all trees T
G of order 53d668" title="Click to view the MathML source" alt="Click to view the MathML source">|V(T)|=r+1, N(T) being the set of vertices not in T that are neighbors of some vertex of T. When r=1, any such considered tree is just an edge of G. Then, ξ1(G) is equal to the so-called minimum edge-degree of G, defined as ξ(G)=min{d(u)+d(v)-2:uv
E(G)}, where d(u) stands for the degree of vertex u. A graph G is said to be optimally r-extraconnected, for short κr-optimal, if κr(G)
ξr(G). In this paper, we present some sufficient conditions that guarantee κr(G)ξr(G) for r2. These results improve some previous related ones, and can be seen as a complement of some others which were obtained by the authors for r=1.
G of order 53d668" title="Click to view the MathML source" alt="Click to view the MathML source">|V(T)|=r+1, N(T) being the set of vertices not in T that are neighbors of some vertex of T. When r=1, any such considered tree is just an edge of G. Then, ξ1(G) is equal to the so-called minimum edge-degree of G, defined as ξ(G)=min{d(u)+d(v)-2:uvE(G)}, where d(u) stands for the degree of vertex u. A graph G is said to be optimally r-extraconnected, for short κr-optimal, if κr(G)ξr(G). In this paper, we present some sufficient conditions that guarantee κr(G)ξr(G) for r2. These results improve some previous related ones, and can be seen as a complement of some others which were obtained by the authors for r=1.