1970/01/01-1970/01/01
Abstract
The spread of a graph is the difference between the largest and smallest eigenvalue of its adjacency matrix. In this talk, we will present some new progress on this topic.
数学系主页
© 2015 All Rights Reserved. 粤ICP备14051456号
南方科技大学数学系