期刊文献+

网络图的韧性度——优化设计(1) 被引量:1

The Tenacity of Network Graphs ——Optimization Design(1)
下载PDF
导出
摘要 研究在韧性度意义下网络的优化设计理论,获得了①在韧性度值及网络图顶点数已知的条件下网络所具有的最大韧性度结构及相应的构造方法;②在连通分支数及网络图顶点数已知的条件下,网络所具有的最大韧性度结构及相应的构造方法;③在连通分支最大顶点数及网络图顶点数已知的条件下,网络所具有的最大韧性度结构及相应的构造方法. In this paper, the optimization design of network under tenacity theory was studied. Results show that the maximum tenacity and its network structure were obtained when the number of tenacity and the number of vertices of network, the number of vertices and components, and the number of vertices and the largest component were givn, respectively.
出处 《辽宁大学学报(自然科学版)》 CAS 2003年第4期315-316,共2页 Journal of Liaoning University:Natural Sciences Edition
关键词 网络图 优化设计 韧性度值 连通分支 最大韧性度 tenacity the number of tenacity the number of components the maximum tenacity optimization design.
  • 相关文献

参考文献1

二级参考文献5

  • 1[1]V, Chvatal. Tough Graphs and Hamiltonian circuits[J]. Disc Math 1973, (5):215-228.
  • 2[2]C.A. Barefoot, R. Entringer, and H. Swart. Integrity of trees and powers of cycles[J]. Cong Num 1987, (58):103-114.
  • 3[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.
  • 4[4]G. Chartrand and S. Schuster, On the independence number of complemetary graphs[J], Trans. New York,Acad. Sci. Ser Ⅱ,1974, (36):247-251.
  • 5[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 ).

共引文献2

同被引文献1

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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