An alternate proof of the formula for the characteristic polynomial of a threshold graph (Q5251973)
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: An alternate proof of the formula for the characteristic polynomial of a threshold graph |
scientific article; zbMATH DE number 6438404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An alternate proof of the formula for the characteristic polynomial of a threshold graph |
scientific article; zbMATH DE number 6438404 |
Statements
21 May 2015
0 references
matrix-tree theorem
0 references
characteristic polynomial
0 references
spanning trees
0 references
Laplacian
0 references
0.8162403106689453
0 references
0.8162403106689453
0 references
0.7970559597015381
0 references
0.7801085114479065
0 references
0.7785959243774414
0 references
