Study Program of Electrical Engineering, Faculty of Engineering, President University Jalan Ki Hajar Dewantoro, Kota Jababeka, Bekasi 17550, Indonesia E-mail: asuharto77@yahoo.com
Abstract. 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.
Begin on 10 October 2014 this website is no longer activated for article process in Journal of Mathematical and Fundamental Sciences, Journal of Engineering and Technological Sciences,
Journal of ICT Research and Applications and Journal of Visual Art and Design. The next process will be proceeded under new website at http://journals.itb.ac.id.
Download Article