期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

广义乘积图的3限制边连通性

3-Restricted Edge Connectivity of Generality Product Graphs
原文传递
导出
摘要 广义乘积图的概念在1984年由Bermond等人提出,Balbuena等人在2007年提出并证明了广义乘积图的边连通度和限制边连通度的上下界.继前人的工作,继续讨论证明了这类图的3限制边连通度的上下界. The generality product graphs G1 ＊ G2 of two given graphs G1 and G2 was defined by Bermond et M. [Large graphs with given degree and diameter II, J. Combin. Theorem Ser. B36 （1984） 32-48]. Balbuena et al. provided and proved edge connectivity and restricted edge connectivity for this kind of graphs [On the dege-connectivity and restricted edge-connectivity of a product of graph, Discrete Applied Mathematics, 2007, 155： 2444- 2455. ]. The author continues their works, bounds of 3-restricted＇ edge connectivity is given and proved in this paper.
作者 朱铁丹
机构地区 五邑大学数学与计算科学学院
出处 《数学的实践与认识》 CSCD 北大核心 2012年第17期238-244,共7页 Mathematics in Practice and Theory
基金 国家自然科学基金(10801091)
关键词 广义乘积图 3限制边割 3限制边连通度 generality product graphs 3 restricted edge cut 3 restricted edge connectivity
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献13

  • 1Bermond J, Belorme C, Farhi C. Large graphs with given degree and diameter II[J]. J Combin Theory Ser, 1984, B36: 32-48.
  • 2Balbuena C, Cera M, Bianez A, Garcia-Vazquez P, Marcote X. On the dege-connectivity and re- stricted edge-connectivity of a product of graph[J]. Discrete Applied Mathematics, 2007, 155: 2444- 2455.
  • 3Chartrand G, Harary F. Planar permutation graphs[J]. Ann Inst H Poincare Sec, 1967, B3: 433-438.
  • 4Li Q L and Li Q. Reliability analysis of circulant graphs[J]. Networks, 1998, 28: 61-65.
  • 5Esfahanian A H and Hakimi S L. On computing a conditional edge connectivity of a graph[J]. Inform Process Lett, 1988, 27: 195-199.
  • 6Meng J X and Ji Y. On a kind of restricted edge connectivity of graphs[J]. Discrete Appl Math, 2002, 117: 183-193.
  • 7Shieh B S. Super edge- and point-connectivity of the cartesian product of regular graphs[J]. Net- works, 2002, 40: 91-96.
  • 8Jian-pingOu,Fu-jiZhang.Bound on m-restricted Edge Connectivity[J].Acta Mathematicae Applicatae Sinica,2003,19(3):505-510. 被引量：4
  • 9OU Jian-pingDepartment of Mathematics, Shantou University, Shantou 515063, China,Department of Mathematics, Zhangzhou Normal College, Zhangzhou 363000, China.Restricted Edge Connectivity of Binary Undirected Kautz Graphs[J].Chinese Quarterly Journal of Mathematics,2004,19(1):47-50. 被引量：3
  • 10Harary F. Conditional connectivity[J]. Networks, 1983, 13: 346-357.

二级参考文献13

  • 1Boesch, F , Wang, J. Super line connectivity properties of circulant graphs. SIAM J Algebra Discrete Math , 1:89-98 (1986).
  • 2Bondy, J A , Murty, U S R. Graph theory with application. MacMillan Press, London, 1976.
  • 3Esfahanian, A H , Hakimi, S L. On computing a conditional edge connectivity of graph. Inform Process Lett , 27:195 199 (1988).
  • 4Meng, J , Ji, Y. on a kind of restricted edge connectivity of graphs. Discrete Appl Math. 117:183 193(2002).
  • 5Wang, Y Q. Properties of high order edge connectivity of graphs and network reliability comparison.Doctoral Dissertation, Shanghai Jiaotong, 2001.
  • 6DU Ding-zha,HSU D F,Hung Q NGO,et al.On the connectivity of consecutive-d digraphs[].Discrete Mathematics.2002
  • 7CHARLES DELORME,TILLICH Jean-pierre.The spectrum of de Bruijn and Kautz graphs[].European Journal of Combinatorics.1998
  • 8BOND J B,PERAT C.Diameter and reliability of some large interconnection networks[].Congressus Numerantium.1988
  • 9NATHALIE HOMOBONO,CLAUDINE PEYRAT.Fault-tolerant routings in Kautz and de Bruijn net works[].Discrete Applied Mathematics.1989
  • 10BAUER D,et al.Combinatorial optimization problems in analysis and design of probabilistic networks[].Networks.1985

共引文献5

数学的实践与认识
2012年 第17期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部