کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4599440 1631137 2014 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The Laplacian spectral excess theorem for distance-regular graphs
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
The Laplacian spectral excess theorem for distance-regular graphs
چکیده انگلیسی

The spectral excess theorem states that, in a regular graph Γ, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above by the spectral excess (a number that is computed by using the adjacency spectrum of Γ), and Γ is distance-regular if and only if equality holds. In this note we prove the corresponding result by using the Laplacian spectrum without requiring regularity of Γ.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 458, 1 October 2014, Pages 245–250
نویسندگان
, ,