Computing the weighted Wiener and Szeged number on weighted cactus graphs in linear timeZmazek, Blaž (Avtor) Žerovnik, Janez (Avtor) mathematicsgraph theoryWiener numberSzeged numberweighted cactuslinear algorithmCactus 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.20032017-07-05 08:55:53Znanstveno delo66650ISSN: 0011-1643UDK: 519.17OceCobissID: 22807COBISS_ID: 8039958ISSN pri članku: 0011-1643NUK URN: URN:SI:UM:DK:5R2URYH1sl