<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>On vulnerability measures of networks</dc:title><dc:creator>Erveš,	Rija	(Avtor)
	</dc:creator><dc:creator>Rupnik Poklukar,	Darja	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>discrete optimization</dc:subject><dc:subject>communication network</dc:subject><dc:subject>vulnerability</dc:subject><dc:description>As links and nodes of interconnection networks are exposed to failures, one of the most important features of a practical networks design is fault tolerance. Vulnerability measures of communication networks are discussed including the connectivities, fault diameters, and measures based on Hosoya- Wiener polynomial. An upper bound for the edge fault diameter of product graphs is proved.</dc:description><dc:date>2013</dc:date><dc:date>2017-07-21 08:37:59</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>66966</dc:identifier><dc:identifier>ISSN: 1848-0225</dc:identifier><dc:identifier>UDK: 519.8:519.17:004.7</dc:identifier><dc:identifier>OceCobissID: 12655131</dc:identifier><dc:identifier>COBISS_ID: 12652571</dc:identifier><dc:identifier>ISSN pri članku: 1848-0225</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:61WTTAMK</dc:identifier><dc:language>sl</dc:language></metadata>
