The graphs for which the maximum multiplicity of an eigenvalue is two (Q3399125): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Computation of minimal rank and path cover number for certain graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Fiedler's characterization of tridiagonal matrices over arbitrary fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of tridiagonal matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs whose positive semi-definite matrices have nullity at most two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank | |||
Normal rank | |||
Latest revision as of 00:44, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graphs for which the maximum multiplicity of an eigenvalue is two |
scientific article |
Statements
The graphs for which the maximum multiplicity of an eigenvalue is two (English)
0 references
29 September 2009
0 references
graph
0 references
partial 2-tree
0 references
linear partial 2-tree
0 references
exceptional partial 2-tree
0 references
eigenvalue
0 references
minimum rank of a graph
0 references
