首页 | 本学科首页   官方微博 | 高级检索  
     检索      

n重线有向图的超连通性
引用本文:张昭,刘凤霞,孟吉翔.n重线有向图的超连通性[J].运筹学学报,2005,9(2):35-39.
作者姓名:张昭  刘凤霞  孟吉翔
作者单位:1. 新疆大学数学与系统科学学院,乌鲁木齐,830046;郑州大学数学系,郑州,450052
2. 新疆大学数学与系统科学学院,乌鲁木齐,830046
摘    要:本文证明了,在最小度至少为3的前提下超弧连通有向图的迭代线图是超点连通的.作为推论,我们得到了Kautz网络和de Bruijn网络的超点连通性和超弧连通性.

关 键 词:线有向图  弧连通性  最小度  网络  线图  迭代

Super-Connected n-th Iterated Line Digraphs
Zhang Zhao,LIU Fengxia,Meng Jixiang.Super-Connected n-th Iterated Line Digraphs[J].OR Transactions,2005,9(2):35-39.
Authors:Zhang Zhao  LIU Fengxia  Meng Jixiang
Institution:Zhang Zhao Liu Fengxia Meng Jixiang College of Mathematics and System Sciences,Xinjiang University,Urmuqi,830046, Department of Mathematics,Zhengzhou University,Zhengzhou,450052,
Abstract:In this paper, we show that under the condition that the minimum degree is at least 3, the iterated line digraph of a super-arc-connected digraph is super-connected. As a consequence, the super-connectedness and super-arc-connectedness of the well known Kautz networks and the de Bruijn networks are obtained.
Keywords:Operations research  line digraph  super-connected  super-arc-connected  de Bruijn networks  Kautz networks
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号