Maximum and minimum nullity of a tree degree sequence

Publication date 6 June 2018

Trees (05C05) Vertex degrees (05C07) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The nullity of a graph is the multiplicity of the eigenvalue zero in its adjacency spectrum. In this paper, we give a closed formula for the minimum and maximum nullity among trees with the same degree sequence, using the notion of matching number and annihilation number. Algorithms for constructing such minimum-nullity and maximum-nullity trees are described.

This page was built for publication: Maximum and minimum nullity of a tree degree sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6302664)