%0 Journal Article
%T Edge Connectivity Problems in Telecommunication Networks
%A Antonius Suhartomo
%J ITB Journal of Information and Communication Technology
%D 2012
%I Institut Teknologi Bandung
%R 10.5614/itbj.ict.2012.6.3.3
%X 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.
%K edge-connectivity
%K k-component edge-failure set
%K k-component edge-failure state
%K k-component order edge-connectivity
%K minimum degree.
%U http://journal.itb.ac.id/download.php?file=C12236.pdf&id=1385&up=2