<?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>Wiener index of strong product of graphs</dc:title><dc:creator>Peterin,	Iztok	(Avtor)
	</dc:creator><dc:creator>Žigert Pleteršek,	Petra	(Avtor)
	</dc:creator><dc:subject>Wiener index</dc:subject><dc:subject>graph product</dc:subject><dc:subject>strong product</dc:subject><dc:description>The Wiener index of a connected graph ▫$G$▫ is the sum of distances between all pairs of vertices of ▫$G$▫. The strong product is one of the four most investigated graph products. In this paper the general formula for the Wiener index of the strong product of connected graphs is given. The formula can be simplified if both factors are graphs with the constant eccentricity. Consequently, closed formulas for the Wiener index of the strong product of a connected graph ▫$G$▫ with a cycle are derived.</dc:description><dc:date>2018</dc:date><dc:date>2017-11-30 15:35:13</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>69137</dc:identifier><dc:identifier>ISSN: 1232-9274</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>OceCobissID: 16179545</dc:identifier><dc:identifier>COBISS_ID: 18179417</dc:identifier><dc:identifier>DOI: 10.7494/OpMath.2018.38.1.81</dc:identifier><dc:identifier>ISSN pri članku: 1232-9274</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:GJ6TJGJV</dc:identifier><dc:language>sl</dc:language></metadata>
