Opis: A new graph operation is proposed which generalizes two operatins by Hua and its usability is illustrated by proving a theorem which characterizes the graphs with given number of cut-edges and minimal value of the Wiener number.Ključne besede: kemijska teorija grafov, topološki indeksi, Wienerjevo število, chemical graph theory, topological indices, Wiener numberObjavljeno v DKUM: 10.07.2015; Ogledov: 13941; Prenosov: 47 Povezava na celotno besedilo
