Wiener index of strong product of graphs

Peterin, Iztok; Žigert Pleteršek, Petra

| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

First page > Show document

Show document

Title:	Wiener index of strong product of graphs
Authors:	ID Peterin, Iztok (Author) ID Žigert Pleteršek, Petra (Author)
Files:	Opuscula_Mathematica_2018_Peterin,_Zigert_Pletersek_Wiener_index_of_strong_product_of_graphs.pdf (424,67 KB) MD5: 4524476B2D369E537B566E13161D3F6B PID: 20.500.12556/dkum/8bf5ec18-9df6-4ecc-a4cc-b04c1601e7d1 http://www.opuscula.agh.edu.pl/vol38/1/art/opuscula_math_3805.pdf
Language:	English
Work type:	Scientific work
Typology:	1.01 - Original Scientific Article
Organization:	FERI - Faculty of Electrical Engineering and Computer Science
Abstract:	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.
Keywords:	Wiener index, graph product, strong product
Publication status:	Published
Publication version:	Version of Record
Year of publishing:	2018
Number of pages:	str. 81-94
Numbering:	Letn. 38, št. 1
PID:	20.500.12556/DKUM-69137
ISSN:	1232-9274
UDC:	519.17
ISSN on article:	1232-9274
COBISS.SI-ID:	18179417
DOI:	10.7494/OpMath.2018.38.1.81
NUK URN:	URN:SI:UM:DK:GJ6TJGJV
Publication date in DKUM:	30.11.2017
Views:	1705
Downloads:	467
Metadata:
Categories:	Misc.
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:	Rocznik Akademii Górniczo-Hutniczej im. Stanisława Staszica. Opuscula Mathematica
Shortened title:	Rocz. Akad. Gór.-Hut. im. Stanisława Staszica, Opusc. Math.
Publisher:	AGH University of Science and Technology Press
ISSN:	1232-9274
COBISS.SI-ID:	16179545

Document is financed by a project

Funder:	ARRS - Slovenian Research Agency
Project number:	P1-0297
Name:	Teorija grafov

Licences

License:	CC BY-NC 4.0, Creative Commons Attribution-NonCommercial 4.0 International

Link:	http://creativecommons.org/licenses/by-nc/4.0/
Description:	A creative commons license that bans commercial use, but the users don’t have to license their derivative works on the same terms.
Licensing start date:	30.11.2017

Secondary language

Language:	Slovenian
Title:	Wienerjev indeks krepkega produkta grafov
Abstract:	Wienerjev indeks povezanega grafa ▫$G$▫ je vsota razdalj med vsemi pari vozlišč grafa ▫$G$▫. Krepki produkt spada med štiri najbolj raziskovane grafovske produkte. V tem delu predstavimo splošno formulo za Wienerjev indeks krepkega produkta povezanih grafov. Če imata oba grafa konstantno ekscentričnost, se formula poenostavi. Posledica tega so zaprte formule za Wienerjev indeks krepkega produkta povezanega grafa ▫$G$▫ s ciklom, ki so tudi predstavljene.
Keywords:	Wienerjev indeks, produkt grafov, krepki produkt

Comments

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back