| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9498548 | Linear Algebra and its Applications | 2005 | 7 Pages |
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 â 2â(n â 1)/Dâ. Methods for constructing such maximum-nullity trees are described.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Stanley Fiorini, Ivan Gutman, Irene Sciriha,