Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs (Q950661)
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: Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs |
scientific article; zbMATH DE number 5360278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs |
scientific article; zbMATH DE number 5360278 |
Statements
Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs (English)
0 references
3 November 2008
0 references
Laplacian polynomial
0 references
characteristic polynomial
0 references
number of spanning trees
0 references
0.807908833026886
0 references
0.7953938841819763
0 references
0.7912663817405701
0 references
