Graphs with given number of cut-edges and minimal value of Wiener number ## AbstractA new graph operation is proposed which generalizes two operations by Hua and its usability is illustrated by proving a theorem which characterizes the graphs whith given number of cut-edges and minimal value of the Wiener number.
[Edit] |