|
Graphs with given number of cut-edges and minimal value of Wiener number
Petra Šparl and Janez Žerovnik
Int. j. chem. model.
Volume 3,
Number 1/2,
,
2011.
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. | EPrint Type: | Article |
|---|
| Project Keyword: | Project Keyword UNSPECIFIED |
|---|
| Subjects: | Theory & Algorithms |
|---|
| ID Code: | 8681 |
|---|
| Deposited By: | Igor Pesek |
|---|
| Deposited On: | 20 February 2012 |
|---|
[Edit]
| 