34224

Автор(ов): 

1

Параметры публикации
Тип публикации: 
Статья в журнале/сборнике
Название: 
Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences
ISBN/ISSN: 
0340-6253
Наименование источника: 
MATCH Communications in Mathematical and in Computer Chemistry
Обозначение и номер тома: 
Volume 75, Issue 1
Город: 
Kraguevac
Издательство: 
Kraguevac University
Год издания: 
2016
Страницы: 
3-27
Аннотация
In 1997 Klavzar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be the, so-called, Huffman tree built in a bottom-up manner by sequentially connecting vertices of the least weights.
Библиографическая ссылка: 
Губко М.В. Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences // MATCH Communications in Mathematical and in Computer Chemistry. 2016. Volume 75, Issue 1. С. 3-27.