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

极大与超级局部边连通有向图的邻域条件

Neighborhood conditions for maximally and super-local-edge-connected digraphs
下载PDF
导出
摘要 本文主要给出了有向图和二部有向图是极大局部边连通和超级局部边连通的邻域条件,不同的例子说明这些条件是最好可能的。 This paper presents neighborhood conditions for maximally local-edge-connected and super-local-edge- connected digraphs and bipartite digraphs. Different examples show that these conditions are most possible.
作者 高敬振 吕敏
机构地区 山东师范大学数学科学学院
出处 《山东科学》 CAS 2012年第5期1-5,共5页 Shandong Science
基金 国家自然科学基金(10901097) 山东省自然科学基金(ZR2010AQ003) 山东省高等学校科技计划(J10LA11)
关键词 有向图 二部有向图 极大局部边连通 超级局部边连通 邻域条件 digraph bipartite digraph maximally local-edge-connected super-local-edge-connected neighborhoodcondition
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献7

  • 1HELLWIG A, VOLKMANN L. Maximally edge-connected and vertex-connected graphs and diagraphs: a survey [ J ]. Discrete Math, 2008, 308( 15): 3265-3296.
  • 2BAUER D, BOESCH F, SUFFEL C, et al. Connectivity extremal problems and the design of reliable probabilistic networks [ C ]// The Theory and Application of Graphs:Proceedings of the 4th international conference on the theory and applications of graphs. New York: John Wiley & Sons, Inc, 1981:45 -54.
  • 3HELLWIG A, VOLKMANN L. Maximally local-edge-connected graphs and digraphs [ J]. Ars Combin, 2004, 72:295 -306.
  • 4高敬振.有向图的边割(X,Y)中|X|和|Y|的下界与有向图的极大性和超级性[J].系统科学与数学,2011,31(12):1602-1612. 被引量：10
  • 5HELLWIG A, VOLKMANN L. Neighborhood conditions for graphs and digraphs to be maximally edge-connected[ J]. Australas J Combin, 2005, 33:265-277.
  • 6HELLWIG A, VOLKMANN L. Neighborhood and degree conditions for super-edge-connected bipartite digraphs [ J ]. Result Math, 2004, 45:45 -58.
  • 7高敬振,吴芳.有向图和二部有向图的局部边连通性[J].山东师范大学学报（自然科学版）,2012,27(1):20-24. 被引量：2

二级参考文献23

  • 1王世英,林上为.网络边连通性的最优化[M].北京:科学出版社,2009.
  • 2Xu J M. Topological Structure and Analysis of Interconnection Networks. Dordrecht, Boston, London: Kluwer Academic Publishers, 2001.
  • 3王世英,林上为.网络边连通性的最优化.北京:科学出版社,2009.
  • 4Boesch F T. On unreliability polynomials and graph connectivity in reliable networks synthesis. J. Graph Theory, 1986, 10(3): 339 352.
  • 5Bauer D, Boesch F T, Suffel C, Tindell R. Connectivity extremal problems in the analysis and design of probabilistic networks. Chartrand G,et al (eds), The Theory and Applications of Graphs. New York: Wiley, 1981.
  • 6Boesch F T. Synthesis of reliable networks-A survey. IEEE Trans.Reliability, 1986 ,35: 240-246.
  • 7Hellwig A, Volkmann L. Maximally local-edge-connected graphs and digraphs. Ars Combin., 2004, 72: 2195-306.
  • 8Volkmann L. Local-edge-connectivity in digraphs and oriented graphs. Discrete Math., 2007, 307: 3207-3212.
  • 9Volkmann L. On local connectivity of graphs with given clique number. J. Graph Theory, 2010, 63: 192-197.
  • 10Hellwig A, Volkmann L. Maximally edge-connected digraphs. Australas. J. Combin., 2003, 27: 23-32.

共引文献10

山东科学
2012年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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