| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 1 / 1
First pagePrevious page1Next pageLast page
1.
Computing the weighted Wiener and Szeged number on weighted cactus graphs in linear time
Blaž Zmazek, Janez Žerovnik, 2003, original scientific article

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: mathematics, graph theory, Wiener number, Szeged number, weighted cactus, linear algorithm
Published: 05.07.2017; Views: 376; Downloads: 69
.pdf Full text (130,41 KB)
This document has many files! More...

Search done in 0.02 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica