<?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=51558"><dc:title>A theorem on Wiener-type invariants for isometric subgraphs of hypercubes</dc:title><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Gutman,	Ivan	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>graph distance</dc:subject><dc:subject>hypercube</dc:subject><dc:subject>partial cube</dc:subject><dc:subject>Wiener number</dc:subject><dc:subject>hyper-Wiener indeks</dc:subject><dc:description>Let ▫$d(G,k)$▫ be the number of pairs of vertices of a graph ▫$G$▫ that are at distance ▫$k$▫, ▫$lambda$▫ a real (or complex) number, and ▫$W_lambda(G) = sum_{k ge 1}d(G,k)k^lambda$▫. It is proved that for a partial cube ▫$G$▫, ▫$W_{lambda + 1}(G) = |mathcal{F}| W_lambda(G) - sum_{mathnormal{F} in mathcal{F}} W_lambda(G setminus F)$▫ where ▫$mathcal{F}$▫ is the partition of ▫$E(G)$▫ induced by the Djokovic-Winkler relation ▫$Theta$▫. This result extends a previously known result for trees and implies several relations for distance-based topological indices.</dc:description><dc:publisher>Elsevier</dc:publisher><dc:date>2006</dc:date><dc:date>2015-07-10 14:54:46</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>51558</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
