Original scientific paper

Computing the Weighted Wiener and Szeged Number on Weighted Cactus Graphs in Linear Time

Blaž Zmazek ; Faculty of Mechanical Engineering, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia
Janez Žerovnik ; Faculty of Mechanical Engineering, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia

Abstract

Cactus is a graph in which every edge lies on at most one cycle. Linear algorithms for computing the weighted Wiener and Szeged numbers on weighted cactus graphs are given. Graphs with weighted vertices and edges correspond to molecular graphs with heteroatoms.

Keywords

weighted cactus graphs; weighted Wiener number; weighted Szeged number

Hrčak ID:

103089

URI

https://hrcak.srce.hr/103089

Publication date:

30.6.2003.

Visits: 1.388 *