Bounds on the largest eigenvalues of trees with a given size of matching (Q1347942): Difference between revisions
From MaRDI portal
Set profile property. |
m rollbackEdits.php mass rollback |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on the second largest eigenvalue of a tree with perfect matchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3907599 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The largest eigenvalue of a graph: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the two largest eigenvalues of trees / rank | |||
Normal rank | |||
Latest revision as of 16:44, 21 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the largest eigenvalues of trees with a given size of matching |
scientific article |
Statements
Bounds on the largest eigenvalues of trees with a given size of matching (English)
0 references
15 May 2002
0 references
upper bound
0 references
largest eigenvalue of a tree
0 references
matching
0 references
