کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4598530 1631090 2016 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Eigenvalue location for chain graphs
ترجمه فارسی عنوان
موقعیت واقعی برای نمودارهای زنجیره ای
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
چکیده انگلیسی
Chain graphs (also called double nested graphs) play an important role in the spectral graph theory since every connected bipartite graph of fixed order and size with maximal largest eigenvalue is a chain graph. In this paper, for a given chain graph G, we present an algorithmic procedure for obtaining a diagonal matrix congruent to A+xI, where A is the adjacency matrix of G and x any real number. Using this procedure we show that any chain graph has its least positive eigenvalue greater than 12, and also prove that this bound is best possible. A similar procedure for threshold graphs (also called nested split graphs) is outlined.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 505, 15 September 2016, Pages 194-210
نویسندگان
, , ,