کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4602768 1336937 2008 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Wielandt type theorem for Cartesian product of digraphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
Wielandt type theorem for Cartesian product of digraphs
چکیده انگلیسی

We show that mn-1 is an upper bound of the exponent of the Cartesian product D×E of two digraphs D and E on m,n vertices, respectively and we prove our upper bound is extremal when (m,n)=1. We also find all D and E when the exponent of D×E is mn-1. In addition, when m=n, we prove that the extremal upper bound of exp(D×E) is n2-n+1 and only the Cartesian product, Zn×Wn, of the directed cycle and Wielandt digraph has exponent equals to this bound.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 429, Issue 4, 1 August 2008, Pages 841-848