<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=51431"><dc:title>Graphs with given number of cut-edges and minimal value of Wiener number</dc:title><dc:creator>Šparl,	Petra	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>kemijska teorija grafov</dc:subject><dc:subject>topološki indeksi</dc:subject><dc:subject>Wienerjevo število</dc:subject><dc:subject>chemical graph theory</dc:subject><dc:subject>topological indices</dc:subject><dc:subject>Wiener number</dc:subject><dc:subject/><dc:description>A new graph operation is proposed which generalizes two operatins by Hua and its usability is illustrated by proving a theorem which characterizes the graphs with given number of cut-edges and minimal value of the Wiener number.</dc:description><dc:date>2011</dc:date><dc:date>2015-07-10 14:46:29</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51431</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
