Ordering trees by the spectral radius of Laplacian
type: Item
instance of: scholarly article
title: Ordering trees by the spectral radius of Laplacian
zbMATH Open document ID: 0953.05047
author: Jinsong Tan
published in: Proceedings of the Japan Academy. Series A
publication date: 2001-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1443781
zbMATH Keywords: adjacency operator
zbMATH Keywords: partial ordering
zbMATH Keywords: eigenvalue of Laplacian
zbMATH Keywords: algebraic connectivity
zbMATH Keywords: spectral radius
MaRDI profile type: Publication
full work available at URL: pjaa.75.188
OpenAlex ID: W2019656133
cites work: Ordering trees by algebraic connectivity
cites work: The Laplacian Spectrum of a Graph
cites work: Q5572939
cites work: Q4256008
cites work: The Faber-Krahn type isoperimetric inequalities for a graph
cites work: On the eigenvalues of trees
cites work: Laplacian spectra and chromatic numbers of graphs
cites work: Eigenvalue comparison theorems of the discrete Laplacians for a graph
DOI: 10.3792/PJAA.75.188
description: scientific article; zbMATH DE number 1443781