کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871860 | 681668 | 2016 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Orientations of graphs with maximum Wiener index
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper we study the Wiener index (i.e., the total distance or the transmission number) of not necessarily strongly connected digraphs. In order to do so, if in a digraph there is no directed path from a vertex a to a vertex b, we follow the convention that d(a,b)=0, which was independently introduced in several studies of directed networks. By extending the results of PlesnÃk and Moon we characterize tournaments with the maximal and the second maximal Wiener index. We also study oriented Theta-graphs and, as a consequence, we obtain that an orientation of a given graph which yields the maximum Wiener index is not necessarily strongly connected. In particular, we characterize orientations of Theta-graphs Îa,b,0 and Îa,b,1 which result in the maximum Wiener index. In addition, orientations with the maximum Wiener index among strongly connected orientations of Îa,b,c are characterized. We conclude the paper with several open problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 211, 1 October 2016, Pages 121-129
Journal: Discrete Applied Mathematics - Volume 211, 1 October 2016, Pages 121-129
نویسندگان
Martin Knor, Riste Å krekovski, Aleksandra Tepeh,