
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. Among all \(n\)-vertex trees, the star tree has greatest nullity (equal to \(n-2\)). In this paper it is shown that among all \(n\)-vertex trees whose vertex degrees do not exceed a fixed value \(D\), the greatest nullity is \(n- 2 \lceil (n-1)/D \rceil\). In addition, methods for constructing some such greatest nullity trees are presented, together with a conjectured description of these trees.
Eigenvalues (of graphs), Maximum-nullity trees, Numerical Analysis, Algebra and Number Theory, Maximal matchings, Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalues, Independent edges, Trees, Discrete Mathematics and Combinatorics, Geometry and Topology, Nullity, maximal matchings
Eigenvalues (of graphs), Maximum-nullity trees, Numerical Analysis, Algebra and Number Theory, Maximal matchings, Graphs and linear algebra (matrices, eigenvalues, etc.), eigenvalues, Independent edges, Trees, Discrete Mathematics and Combinatorics, Geometry and Topology, Nullity, maximal matchings
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 76 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
