Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Edge Connectivity Problems in Telecommunication Networks

Journal of ICT Research and Applications (JICTRA) · Vol. 6 No. 3 (2013) · pp. 208–219

DOI
10.5614/itbj.ict.2012.6.3.3
ISSN
2338-5499, 2337-5787
Published
2013-09-13
Publisher
DRI - ITB
Language
eng

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.

Collaboration network of the authors

No co-authors found in Melola yet.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Edge Connectivity Problems in Telecommunication Networks</dc:title>
	<dc:creator>Suhartomo, Antonius</dc:creator>
	<dc:description xml:lang="en-US">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.</dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2013-09-13</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/230</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.2012.6.3.3</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 6 No. 3 (2012); 208-219</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/230/224</dc:relation>
</oai_dc:dc>