34162

Автор(ов): 

1

Параметры публикации
Тип публикации: 
Книга (брошюра, монография, стандарт)
Название: 
On Minimum Terminal Distance Spectral Radius of Tree with Given Degree Sequence
Сведения об издании: 
ArXivPreprint: http://arxiv.org/abs/1507.01733
Сведения об издании: 
1-ое издание
Электронная публикация: 
Да
ISBN/ISSN: 
2331-8422
Город: 
Ithaca
Издательство: 
Cornell University
Год издания: 
2015
Объём, стр.: 
21
Аннотация
For distance spectral radius (DSR) and terminal distance spectral radius (TDSR) of tree with given sequence of vertex degrees we suggest a family of lower bounds in terms of Wiener and, respectively, terminal Wiener indices for (recently studied) vertex-weighted “Huffman” trees. For TDSR the best lower bound in the family appears to be average row sum of terminal distance matrix of BFS-tree (also known as greedy tree). Numeric simulations show that this lower bound is almost attained (error is less than 3% for TDSR and less than 6% for DSR). We make a step towards formally proving maximum error 3% for TDSR.
Библиографическая ссылка: 
Губко М.В. On Minimum Terminal Distance Spectral Radius of Tree with Given Degree Sequence. ArXivPreprint: http://arxiv.org/abs/1507.01733. Ithaca, NY: Cornell University, 2015. – 21 с.