A carregar...

The Laplacian Spread of a Tree

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we show that the star is the unique tree with maximal Laplacian spread among all trees of given order, and the p...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Yi-Zheng Fan, Jing Xu, Yi Wang, Dong Liang
Formato: Artigo
Idioma:Inglês
Publicado em: Discrete Mathematics & Theoretical Computer Science 2008-01-01
Colecção:Discrete Mathematics & Theoretical Computer Science
Acesso em linha:http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/714
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!