The number of spanning trees in \(K_n\)-complement of a bipartite graph (Q6618161)
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: The number of spanning trees in \(K_n\)-complement of a bipartite graph |
scientific article; zbMATH DE number 7925634
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of spanning trees in \(K_n\)-complement of a bipartite graph |
scientific article; zbMATH DE number 7925634 |
Statements
The number of spanning trees in \(K_n\)-complement of a bipartite graph (English)
0 references
14 October 2024
0 references
spanning tree
0 references
bipartite graph
0 references
\(K_n\)-complement
0 references
0 references
0 references
0 references
0 references
