| 一类多重字典乘积网络的支撑树计数 |
| |
| 引用本文： | 李峰,彭毅,赵海兴.一类多重字典乘积网络的支撑树计数[J].软件,2011,32(7):51-53. |
| |
| 作者姓名： | 李峰 彭毅 赵海兴 |
| |
| 作者单位： | 1. 西安交通大学信息与系统科学研究所,陕西,西安,710049;西安交通大学智能网络与网络安全教育部重点实验室,陕西,西安,710049
2. 青海师范大学计算机学院,青海,西宁,810008 |
| |
| 基金项目： | 国家973计划资助项目，国家自然基金资助 |
| |
| 摘 要： | 网络的支撑树个数是衡量一个网络可靠性程度的重要参考指标. 利用字典乘积方法设计的网络, 在应用数学与网络优化设计与分析领域变的重要起来．本文利用组合方法给出了一类新网络的支撑树计数公式，它仅仅依赖小网络的结构拓扑参数：阶数，拉谱拉斯特征值等．
|
| 关 键 词： | 网络 字典乘积 支撑树 拉谱拉斯矩阵 |
On the number of spanning trees of the multi-lexicographic product of networks |
| |
| LI Feng,PENG Yi,ZHAO Haixing.On the number of spanning trees of the multi-lexicographic product of networks[J].Software,2011,32(7):51-53. |
| |
| Authors: | LI Feng PENG Yi ZHAO Haixing |
| |
| Affiliation: | 1.Institute of Information and System Sciences,Faculty of Science,Xi’an Jiaotong University,Xi’an 710049,China;2.Ministry of Education Key Lab for Intelligent Networks and Network Security,Xi’an Jiaotong University,Xi’an 710049,China;3.Computer College,Qinghai Normal University,Xi’ning 810008,China) |
| |
| Abstract: | The number of the spanning trees is a very important index in the analysis and synthesis of reliable networks.Product networks play a vital role not only in applied mathematics but also in computer science.This paper use the combination method to establish the formula for the number of spanning trees of the lexicogaphic product of three networks,the formula which only depends on the number of the verticex and the lapalacian eigenvalues of the factor networks. |
| |
| Keywords: | Networks Lexicographic Product Spanning Trees Lapalacian Matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
