Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minim...Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. The g-component connectivity of a graph G, denoted by , is the minimum number of vertices whose removal from G results in a disconnected graph with at least g components or a graph with fewer than g vertices. The g-component edge connectivity can be defined similarly. In this paper, we determine the g-component (edge) connectivity of varietal hypercube for small g.展开更多
现阶段在信息化时代的不断发展下,对于通信技术的高度重视已经成为世界各国不约而同的首要任务,作为通信技术的基石,传输网络提供的高可靠大带宽传输电路是各大运营商宽带网络稳定高强度运行的基础,是运营商各类业务有序发展的前提。因...现阶段在信息化时代的不断发展下,对于通信技术的高度重视已经成为世界各国不约而同的首要任务,作为通信技术的基石,传输网络提供的高可靠大带宽传输电路是各大运营商宽带网络稳定高强度运行的基础,是运营商各类业务有序发展的前提。因此,高速OTN传输平台作为输出核心,要在Nx100 G的技术已经有较为稳定的发展的基础上进行能力提升。本文对于400 G OTN关键技术进行研究,并探讨400 G OTN在大型运营商省内主干传输网络的规划部署与建议。展开更多
In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this pape...In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.展开更多
文摘Connectivity is a vital metric to explore fault tolerance and reliability of network structure based on a graph model. Let be a connected graph. A connected graph G is called supper-κ (resp. supper-λ) if every minimum vertex cut (edge cut) of G is the set of neighbors of some vertex in G. The g-component connectivity of a graph G, denoted by , is the minimum number of vertices whose removal from G results in a disconnected graph with at least g components or a graph with fewer than g vertices. The g-component edge connectivity can be defined similarly. In this paper, we determine the g-component (edge) connectivity of varietal hypercube for small g.
文摘现阶段在信息化时代的不断发展下,对于通信技术的高度重视已经成为世界各国不约而同的首要任务,作为通信技术的基石,传输网络提供的高可靠大带宽传输电路是各大运营商宽带网络稳定高强度运行的基础,是运营商各类业务有序发展的前提。因此,高速OTN传输平台作为输出核心,要在Nx100 G的技术已经有较为稳定的发展的基础上进行能力提升。本文对于400 G OTN关键技术进行研究,并探讨400 G OTN在大型运营商省内主干传输网络的规划部署与建议。
文摘In 2012, Hsu et al. generalized the classical connectivity of graph G and introduced the concept of g-component connectivity CK<sub>g</sub> (G) to measure the fault tolerance of networks. In this paper, we determine the g-component connectivity of some graphs, such as fan graph, helm graph, crown graph, Gear graph and the Mycielskian graph of star graph and complete bipartite graph.
