期刊文献+

网络图的韧性度优化设计(II)

On the tenacity of network graphs optimization design(II)
原文传递
导出
摘要 研究在韧性度意义下网络的优化设计理论,获得了在韧性度值及网络图顶点数已知的条件下网络所具有的最大韧性度结构及相应的构造方法;在连通分支数及网络图顶点数已知的条件下,网络所具有的最大韧性度结构及相应的构造方法;在连通分支最大顶点数及网络图顶点数已知的条件下,网络所具有的最大韧性度结构及相应的构造方法. The optimization problems of network graphs under tenacity theory are studied in detail. In this paper,we obtain the following three results:1)The minimum tenacity and its networks structure is obtained when the number of tenacity and the number of vertices of network are given;2)The minimum tenacity and its network structure is obtained when the number of vertices and components are given;3)The minimum tenacity and its network structure is obtained when the number of vertices and the largest component are given.
出处 《大连海事大学学报》 CAS CSCD 北大核心 2003年第4期107-109,共3页 Journal of Dalian Maritime University
关键词 网络图 韧性度 优化设计 连通分支 网络通信 tenacity number of tenacity number of components optimization design
  • 相关文献

参考文献4

二级参考文献17

  • 1朱必文 苏健基.图的连通性研究中的若干问题[J].数学进展,1987,16(2):113-119.
  • 2田峰 马仲蕃.图与网络流理论[M].北京:科学出版社,1987.1-8.
  • 3[1]V, Chvatal. Tough Graphs and Hamiltonian circuits[J]. Disc Math 1973, (5):215-228.
  • 4[2]C.A. Barefoot, R. Entringer, and H. Swart. Integrity of trees and powers of cycles[J]. Cong Num 1987, (58):103-114.
  • 5[3]M.Cozzens,D.Moazzami,and S.stueckle. The tenacity of a graph[J]. procseventh International Conf on the Theory and Applications of Graphs. Wiley, New York, 1995,1111-1122.
  • 6[4]G. Chartrand and S. Schuster, On the independence number of complemetary graphs[J], Trans. New York,Acad. Sci. Ser Ⅱ,1974, (36):247-251.
  • 7[5]Y. Alavi and J. Mitchem, Connectivity and line-connectivity of complementary graphs[M], in: M. Capobianceo,J. B. Frechen and M. Krolik, eds., Recent trends in Graph Theory (springer, New York, 1971 ).
  • 8许进,系统核与核度理论及其应用,1994年,43页
  • 9许进,系统核与核度理论及其应用,1994年,43页
  • 10朱必文,数学进展,1987年,16卷,2期,113页

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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