Cycles and spanning trees (Q1179106): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0895-7177(91)90008-u / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062616635 / rank | |||
Normal rank | |||
Latest revision as of 09:07, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles and spanning trees |
scientific article |
Statements
Cycles and spanning trees (English)
0 references
26 June 1992
0 references
Given a connected graph \(G\), it is shown that the number of labelled spanning trees of \(G\) is equal to the determinant of a cycle-cycle incidence matrix. Using this cycle-based approach, it is seen that the graph of a convex polyhedron and its dual have the same number of spanning trees. The method can also be used to show that certain sequences of algebraic numbers can be represented by a recursive formula using only integers.
0 references
adjacency matrix
0 references
incidence matrix
0 references
cycles
0 references
spanning trees
0 references
algebraic numbers
0 references
