Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues (Q942089): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.08.077 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063761348 / rank | |||
Revision as of 00:35, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues |
scientific article |
Statements
Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues (English)
0 references
4 September 2008
0 references
tree
0 references
Laplacian eigenvalues
0 references
spectral radius
0 references
matching number
0 references
