کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4603375 1336958 2008 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On acyclic and unicyclic graphs whose minimum rank equals the diameter
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
On acyclic and unicyclic graphs whose minimum rank equals the diameter
چکیده انگلیسی

The minimum rank of a graph G is defined as the smallest possible rank over all symmetric matrices governed by G. It is well known that the minimum rank of a connected graph is at least the diameter of that graph. In this paper, we investigate the graphs for which equality holds between minimum rank and diameter, and completely describe the acyclic and unicyclic graphs for which this equality holds.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 429, Issue 7, 1 October 2008, Pages 1568-1578