Comparing the Reliability of Networks&nbsp; Using the Number of Edge Cutsets of Graphs

LI Feng1，XU Zongben1，ZHAO Haixing2

doi:10.3969/j.issn.1007130X.2010.

Computer Engineering & Science >

2010 , Vol. 32 >Issue 9: 9 - 10

DOI: https://doi.org/10.3969/j.issn.1007130X.2010.

论文

Comparing the Reliability of Networks Using the Number of Edge Cutsets of Graphs

Expand

（1． Institute of Information and System Sciences,Xi’an Jiaotong University,Xi’an 710049；
2．School of Mathematics and Information Sciences,Qinghai Normal University,Xi’ning 810008,China)

Received date: 2010-03-05

Revised date: 2010-04-10

Online published: 2010-09-02

Fold

Abstract

The number of the cutsets of a graph is a very important index in the analysis and synthesis of reliable networks. In this paper,we compute the number of the edge cutsets of some specific graphs. Then by using the number of edge cutsets of graphs,we compare the reliability of two networks.

Key words： cutsets；connectivity；reliable network

Cite this article

LI Feng1，XU Zongben1，ZHAO Haixing2 . Comparing the Reliability of Networks Using the Number of Edge Cutsets of Graphs[J]. Computer Engineering & Science, 2010 , 32(9) : 9 -10 . DOI: 10.3969/j.issn.1007130X.2010.

Options

Outlines

模态框（Modal）标题

Abstract

Cite this article