Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph (Q2238881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph |
scientific article |
Statements
Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph (English)
0 references
2 November 2021
0 references
Laplacian coefficient
0 references
threshold graph
0 references
spanning tree
0 references
