超立方体与折叠立方体的分支连通性

发布时间：2018-01-02 05:37

本文关键词：超立方体与折叠立方体的分支连通性　出处：《太原理工大学》2017年硕士论文　论文类型：学位论文

【摘要】：网络的拓扑结构通常用一个连通图来表示,其中用顶点来代表处理器,边来代表连接线.点连通度和边连通度是衡量网络可靠性的重要参数,但是随着大规模网络的不断发展,网络的容错性已经不能由传统的连通度准确地衡量.基于传统连通度的不足,Harary给出了条件(边)连通度的定义.他所定义的条件(边)连通度κ(G;P)(λ(G;P))指的是在图G中删除最少的顶点(边)数使得图G不连通并且它的每个分支都具有性质P.在1984年,Chartrand和Sampathkumar分别引入了分支连通度与分支边连通度的概念.分支(边)连通度实际上也可以看作一种条件连通度,它本质上就是对传统连通度的推广.一个非完全图G的g分支(边)连通度cκg(G)(cλg(G))指的是在图G中删除最少的点(边)数使一个图不连通,同时至少产生了g个分支.其中,cκ2(G)(cλ2(G))就是我们所研究的传统连通度与边连通度.在本文中,我们主要研究了超立方体与折叠立方体的分支连通度与分支边连通度.
[Abstract]:The topology of the network is usually represented by a connected graph in which the processor is represented by the vertex and the connection line is represented by the edge. Point connectivity and edge connectivity are important parameters to measure the reliability of the network. However, with the continuous development of large-scale networks, the fault tolerance of the network can not be accurately measured by the traditional connectivity. Harary gives the definition of conditional (edge) connectivity. P (位 G); P) is to delete the minimum number of vertices (edges) in a graph G so that G is disconnected and that each branch of the graph has the property P. in 1984. Chartrand and Sampathkumar introduce the concepts of branch connectivity and branch edge connectivity respectively. It is essentially a generalization of the traditional connectivity. The g branch (edge) connectivity of a non-complete graph G is a point (edge) that removes the least number of points (edges) from a graph G. Numbers disconnect a graph. At the same time, at least g branches have been produced, in which c 魏 2 G ~ (2) C 位 ~ (2 +) is the traditional connectivity and edge connectivity studied in this paper. We mainly study the branch connectivity and branch edge connectivity of hypercube and folded cube.
【学位授予单位】：太原理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O157.5

【相似文献】