Skip to the main content

Original scientific paper

Computing the Szeged Index

Janez Žerovnik ; Institute of Mathematics, Physics and Mechanics, Department of Theoretical Computer Science, Jadranska 19, Ljubljana, Slovenia


Full text: english pdf 1.873 Kb

page 837-843

downloads: 512

cite


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.

Keywords

Hrčak ID:

177115

URI

https://hrcak.srce.hr/177115

Publication date:

1.11.1996.

Visits: 1.009 *