سال انتشار: ۱۳۸۶

محل انتشار: سی و هشتمین کنفرانس ریاضی ایران

تعداد صفحات: ۲

نویسنده(ها):

JAVAD EBRAHIMI – Department of mathematical Science Statistic, Simon Fraser University, Burnaby, BC, Canada
BOJAN MOHAR – Department of mathematical Science Statistic, Simon Fraser University, Burnaby, BC, Canada
AZHVAN SHEIKH AHMADI – Department of mathematical Science Statistic, Simon Fraser University, Burnaby, BC, Canada

چکیده:

D. Gernet conjectured that the sum of two largest eigenvalues of the adjacency matrix of any simple graph is at most the number of vertices of the graph. This can be proved, in particular, for all also exhibit a nontrivial upper bound for the sum of the two largest eigenvalues and derive a new upper bound for the second largest eigenvalue of the adjacency matrices of the graphs.