کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8898032 | 1631055 | 2018 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Structural properties of minimal strong digraphs versus trees
ترجمه فارسی عنوان
ویژگی های ساختاری حداقل ارجحیت قوی در مقابل درختان
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
چکیده انگلیسی
In this article, we focus on structural properties of minimal strong digraphs (MSDs). We carry out a comparative study of properties of MSDs versus (undirected) trees. For some of these properties, we give the matrix version, regarding nearly reducible matrices. We give bounds for the coefficients of the characteristic polynomial corresponding to the adjacency matrix of trees, and we conjecture bounds for MSDs. We also propose two different representations of an MSD in terms of trees (the union of a spanning tree and a directed forest; and a double directed tree whose vertices are given by the contraction of connected Hasse diagrams).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 540, 1 March 2018, Pages 203-220
Journal: Linear Algebra and its Applications - Volume 540, 1 March 2018, Pages 203-220
نویسندگان
J. GarcÃa-López, C. Marijuán, L.M. Pozo-Coronado,