Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications (Q6096283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7736211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications |
scientific article; zbMATH DE number 7736211 |
Statements
Combinatorial explanation of the weighted Laplacian characteristic polynomial of a graph and applications (English)
0 references
11 September 2023
0 references
rooted spanning forest
0 references
spanning tree
0 references
Laplacian matrix
0 references
generating function
0 references
almost complete bipartite graph
0 references
0.8144707679748535
0 references
0.7793177962303162
0 references
0.7766419649124146
0 references
