کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4648393 1632438 2010 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On extremal weighted digraphs with no heavy paths
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
On extremal weighted digraphs with no heavy paths
چکیده انگلیسی

Bollobás and Scott proved that if the weighted outdegree of every vertex of an edge-weighted digraph is at least 1, then the digraph contains a (directed) path of weight at least 1. In this note we characterize the extremal weighted digraphs with no heavy paths. Our result extends a corresponding theorem of Bondy and Fan on weighted graphs. We also give examples to show that a result of Bondy and Fan on the existence of heavy paths connecting two given vertices in a 2-connected weighted graph does not extend to 2-connected weighted digraphs.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issues 10–11, 6 June 2010, Pages 1640–1644
نویسندگان
, ,