Title of article
Trees with maximum nullity Original Research Article
Author/Authors
Stanley Fiorini، نويسنده , , Ivan Gutman، نويسنده , , Irene Sciriha، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
7
From page
245
To page
251
Abstract
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among n-vertex trees, the star has greatest nullity (equal to n − 2). We generalize this by showing that among n-vertex trees whose vertex degrees do not exceed a certain value D, the greatest nullity is n − 2left ceiling(n − 1)/Dright ceiling. Methods for constructing such maximum-nullity trees are described.
Keywords
Nullity , Trees , Independent edges , Maximalmatchings , Eigenvalues (of graphs) , Maximum-nullity trees
Journal title
Linear Algebra and its Applications
Serial Year
2005
Journal title
Linear Algebra and its Applications
Record number
824721
Link To Document