作者: Yi-Zheng Fan , Yi Wang , Dong Liang , Jing Xu
DOI:
关键词: Eigenvalues and eigenvectors 、 Path (graph theory) 、 Laplacian matrix 、 Discrete mathematics 、 Order (group theory) 、 Graph (abstract data type) 、 Combinatorics 、 Mathematics 、 Tree (graph theory) 、 Star (graph theory) 、 Laplace operator
摘要: The Laplacian spread of a graph is defined to be the difference between largest eigenvalue and second smallest matrix graph. In this paper, we show that star unique tree with maximal among all trees given order, path one minimal order.