Computing the Szeged index

Abstract

Dan je algoritem za računanje szegedskega indeksa grafa s časovno zahtevnostjo ▫$O(m,n)$▫, kjer je ▫$n$▫ število točk, ▫$m$▫ pa število povezav.

Keywords

matematika;kemija;kemijska teorija grafov;molekulski grafi;strukturne formule;topološki indeks;szegedski indeks;algoritmi;mathematics;chemistry;chemical graph theory;molecular graphs;structural formulae;algorithms;topological index;Szeged index;

Data

Language:	English
Year of publishing:	1996
Typology:	1.01 - Original Scientific Article
Organization:	UM FS - Faculty of Mechanical Engineering
UDC:	519.17:541
COBISS:	2415126
ISSN:	0011-1643
Views:	1051
Downloads:	94
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Slovenian
Secondary title:	Računanje szegedskega indeksa
Secondary abstract:	We give an explicit algorithm for computing the Szeged index of a graph which runs in ▫$O(mn)$▫ time, where ▫$n$▫ is the number of nodes and ▫$m$▫ is the number of edges.
Secondary keywords:	matematika;kemija;kemijska teorija grafov;molekulski grafi;strukturne formule;topološki indeks;szegedski indeks;algoritmi;
URN:	URN:SI:UM:
Type (COBISS):	Scientific work
Pages:	str. 837-843
Volume:	ǂLet. ǂ69
Issue:	ǂšt. ǂ3
Chronology:	1996
ID:	10846958