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

网络图广义连通性的基本性质与常见连通结构
引用本文:李元左,邱涤珊. 网络图广义连通性的基本性质与常见连通结构[J]. 系统工程学报, 2000, 15(1): 1-6
作者姓名:李元左  邱涤珊
作者单位:1. 国防科工委指挥技术学院,北京,101416
2. 国防科技大学系统工程与数学系,长沙,410073
摘    要:网络图的广义连通性是通常连通性的推广,它反映了网络图顶点(元素)间一类更为广泛层面上的内在联系,本文通过决策判断信息的网络系统分析,研究了网络图广义连通性的基本性质,并通过考察相应的信息结构特征,给出了广义连通性几种常通结构类型。

关 键 词:网络图 广义连通性 连通结构 图论

Properties of generalized connectedness of graph and commonly-used connecting structures
LI Yuan-zuo,QIU Di-shan. Properties of generalized connectedness of graph and commonly-used connecting structures[J]. Journal of Systems Engineering, 2000, 15(1): 1-6
Authors:LI Yuan-zuo  QIU Di-shan
Abstract:Generalized connectedness of a graph(GGC) is a generalized form of common connectedness, which can reflect the internal relations between vertices(elements) of a graph in a wider scope. In this paper, properties of generalized connectedness of graphs are discussed in terms of a information network system analysis and several commonly used types of connecting structures are explored by studying structural features of judgement information. Some possible relations of information connection are also studied.
Keywords:graph  network  connectedness  information  structure  decision making
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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