| 两类图的一致最优可靠图 |
| |
| 引用本文： | 乔胜宁,李美丽. 两类图的一致最优可靠图[J]. 纺织高校基础科学学报, 2005, 18(3): 199-201 |
| |
| 作者姓名： | 乔胜宁 李美丽 |
| |
| 作者单位： | 1. 西北工业大学,应用数学系,陕西,西安,710072
2. 西安石油大学,理学院,陕西,西安,710065 |
| |
| 摘 要： | 把顶点数是n,边数是e的所有图称作一类图,寻找给定图类的一致最优可靠图.证明了八面体是所在图类及6个顶点12边图类的一致最优可靠图,同时找到了立方体所在图类及8个顶点12边图类的一致最优可靠图.
|
| 关 键 词： | 一致最优可靠图 网络可靠性 八面体 |
| 文章编号： | 1006-8341（2005）03-0199-03 |
| 收稿时间： | 2005-05-18 |
| 修稿时间： | 2005-05-18 |
The uniformly optimally reliable graph of two graphs |
| |
| QIAO Sheng-ning,LI Mei-li. The uniformly optimally reliable graph of two graphs[J]. Basic Sciences Journal of Textile Universities, 2005, 18(3): 199-201 |
| |
| Authors: | QIAO Sheng-ning LI Mei-li |
| |
| Abstract: | A well-known problem for network reliability studies is to find the fixed uniformly optimally reliable graph. In this paper, the uniformly optimally reliable octahedron in graphs with n= 6 and e= 12 is proved. And the uniformly optimally reliable cube in graphs with n=8 and e=12 is found out. |
| |
| Keywords: | uniformly optimally reliable graph network reliability octahedron |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
