# Уѧ¡ͼϵн֮ʮˣ

ʱ䣺2020-09-22

ĿOn median eigenvalues of graphs

: ̨ѧڣ

ժҪLet $G$ be a connected graph of order $n$, and let $\lambda_1\geq \lambda_2 \geq \cdots \geq \lambda_n$ be eigenvalues of the adjacency matrix of $G$. The median eigenvalues of $G$ are $\lambda_H$ and $\lambda_L$, where $H=\lfloor(n+1)/2\rfloor$ and $L= \lceil (n+1)/2\rceil$. In this talk, some recent research progress on median eigenvalues are introduced, with special emphasis being placed on some chemically interesting graphs.

ʱ: 2020924()  15:30-16:30

ص:Ѷң237-987-694

ӭλʦͬѧʱǰ

ѧ

2020922

/