Trees with maximum nullity (Q1774973): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2004.10.024 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2062420428 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4327350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5678898 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3853641 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5510191 / rank | |||
Normal rank |
Latest revision as of 11:01, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trees with maximum nullity |
scientific article |
Statements
Trees with maximum nullity (English)
0 references
4 May 2005
0 references
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.
0 references
eigenvalues
0 references
maximal matchings
0 references