期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Analysis of cut vertex in the control of complex networks
1
作者 周洁 袁诚 +2 位作者 钱祖燏 汪秉宏 聂森 《Chinese Physics B》 SCIE EI CAS CSCD 2023年第2期574-579,共6页
The control of complex networks is affected by their structural characteristic. As a type of key nodes in a network structure, cut vertexes are essential for network connectivity because their removal will disconnect ... The control of complex networks is affected by their structural characteristic. As a type of key nodes in a network structure, cut vertexes are essential for network connectivity because their removal will disconnect the network. Despite their fundamental importance, the influence of the cut vertexes on network control is still uncertain. Here, we reveal the relationship between the cut vertexes and the driver nodes, and find that the driver nodes tend to avoid the cut vertexes.However, driving cut vertexes reduce the energy required for controlling complex networks, since cut vertexes are located near the middle of the control chains. By employing three different node failure strategies, we investigate the impact of cut vertexes failure on the energy required. The results show that cut vertex failures markedly increase the control energy because the cut vertexes are larger-degree nodes. Our results deepen the understanding of the structural characteristic in network control. 展开更多
关键词 cut vertex CONTROLLABILITY control energy structural characteristic complex networks
下载PDF
On the Least Eigenvalue of Graphs with Cut Vertices 被引量:2
2
作者 Yi WANG Yun QIAO Yi Zheng FAN 《Journal of Mathematical Research and Exposition》 CSCD 2010年第6期951-956,共6页
Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,whe... Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,where ψn denotes the set of connected graphs of order n with cut vertices. 展开更多
关键词 adjacency matrix least eigenvalue minimizing graph cut vertex.
下载PDF
Mining Protein Complexes from PPI Networks Using the Minimum Vertex Cut 被引量:1
3
作者 Xiaojun Ding Weiping Wang +1 位作者 Xiaoqing Peng Jianxin Wang 《Tsinghua Science and Technology》 SCIE EI CAS 2012年第6期674-681,共8页
Evidence shows that biological systems are composed of separable functional modules. Identifying protein complexes is essential for understanding the principles of cellular functions. Many methods have been proposed t... Evidence shows that biological systems are composed of separable functional modules. Identifying protein complexes is essential for understanding the principles of cellular functions. Many methods have been proposed to mine protein complexes from protein-protein interaction networks. However, the performances of these algorithms are not good enough since the protein-protein interactions detected from experiments are not complete and have noise. This paper presents an analysis of the topological properties of protein complexes to show that although proteins from the same complex are more highly connected than proteins from different complexes, many protein complexes are not very dense (density ≥0.8). A method is then given to mine protein complexes that are relatively dense (density ≥0.4). In the first step, a topology property is used to identify proteins that are probably in a same complex. Then, a possible boundary is calculated based on a minimum vertex cut for the protein complex. The final complex is formed by the proteins within the boundary. The method is validated on a yeast protein-protein interaction network. The results show that this method has better performance in terms of sensitivity and specificity compared with other methods. The functional consistency is also good. 展开更多
关键词 protein complex protein-protein interaction network minimum vertex cut
原文传递
On Graphs with Cut Vertices and Cut Edges
4
作者 Kun Fu FANG Jin Long SHU 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2014年第3期539-546,共8页
Let G(n,k,t) be a set of graphs with n vertices,k cut edges and t cut vertices.In this paper,we classify these graphs in G(n,k,t) according to cut vertices,and characterize the extremal graphs with the largest spe... Let G(n,k,t) be a set of graphs with n vertices,k cut edges and t cut vertices.In this paper,we classify these graphs in G(n,k,t) according to cut vertices,and characterize the extremal graphs with the largest spectral radius in G(n,k,t). 展开更多
关键词 Spectral radius extremal graph cut vertex cut edge
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部