Edge Connectivity Problems in Telecommunication Networks  

Oleh:

Suhartomo, Antonius

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI
Dalam koleksi: Journal of ICT Research and Applications vol. 6C no. 3 (2012), page 208-219.
Topik: edge-connectivity; k-component edge-failure set; k-component edge Failure state; k-component order edge-connectivity; minimum degree
Fulltext: C12236.pdf (129.5KB)

Isi artikel

If a communication network N with n stations has every station linked with at least (n/2) other stations, then the edge-connectivity of N equals its minimum degree. Also, in general, this limitation is stated to be the best possibility, as was proved by Chartrand in 1966. A more developed notion of edge-connectivity is introduced, which is called k-component order edge-connectivity. It is the minimum number of edges required to be removed so that the order of each disconnected component is less than k.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali