Edge Connectivity Problems in Telecommunication Networks | Zendy

Antonius Suhartomo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Edge Connectivity Problems in Telecommunication Networks

Author(s) -

Antonius Suhartomo

Publication year - 2012

Publication title -

journal of ict research and applications

Language(s) - English

Resource type - Journals

eISSN - 2338-5499

pISSN - 2337-5787

DOI - 10.5614/itbj.ict.2012.6.3.3

Subject(s) - enhanced data rates for gsm evolution , degree (music) , mathematics , order (exchange) , computer science , combinatorics , artificial intelligence , business , physics , finance , acoustics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research